You are not logged in.
login | register
Tool: Planar Graphs
Tool Thumbnail

Go to: (opens a new window)
Description: 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.
Technology Type: Flash 
Author: Barbara Kaskosz
Language: English 
Cost: Does not require payment for use

Average Rating:  [0] Login to rate this resource
My MathTools: Login to Subscribe / Save This
Reviews: be the first to review this resource
Discussions: start a discussion of this resource

Tools: Euler Circuits and Euler Trails
Hamiltonian Cycles
Courses: Discrete Math Graphs and Trees