Contents
- Eulerian graphs
- Hamiltonian graphs
- Planar Graphs
- Graph Isomorphism
This set of problems is similar to the ones on pages 1 and 2, but this time, instead of looking for a particular structure within the graph, the question is whether or not the vertices (nodes) of the graph can be rearranged on the plane so that the edges of the graph do not cross. The user demonstrates an answer of "yes" by actually doing it with a drag-and-drop interface. As before, a negative answer is signaled by giving up.
Click on the image below to open this problem set in a new window:
The definitions and notation referenced in these applications are from Discrete Mathematics by Doug Ensley and Winston Crawley, published by John Wiley & Sons, 2005.
