Revision as of 16:09, 30 November 2008 by Jniederh (Talk)

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

You can prove that the graph is planar by corollary 3. The planar graph can be found by swapping vertices {c,f} and then connecting {a,f} with an arc and {d,c} with a similar arc. All of the other edges are pretty straightforward to draw.
--Jniederh 20:09, 30 November 2008 (UTC)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood