Revision as of 06:38, 6 December 2008 by Norlow (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This graph is planar. I found it easiest to draw by looking at it with f as the top point and d, a, e, c, b below in a line. This is just a suggestion.

I generally find in problems like this to put the points with most connections on the inside, and put the ones with fewer connections on the outside.

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood