Using the palette and controls below, construct any simple graph whose planarity you wish explore. Once you have drawn the graph, deselecting all of the controls allows you to drag the nodes while the edges remain in tact. Hence, if you can drag the nodes until the edges of the graph do not cross, then you have established that the graph is planar. Warning: If you do not manage to arrange the edges so that they do not cross, you have not shown that the graph is non-planar.
|
Copyright 2005 by Douglas E. Ensley. See http://www.ship.edu/~deensl/DiscreteMath/ for more Flash applets for Discrete Mathematics. Please direct questions and comments to deensl@ship.edu.