Types

Planarity

Planarity examines whether or not a given graph can be drawn in a plane without the edges crossing.
The formal definition of planarity is as follow: "A graph G is planar if it can be drawn in the plane in such a way that no two edges meet each other except at a vertex to which they are both incident"
(Wilson & Watkins, 1990)
.
One of the most common problems that deals with planar graphs is the Utilities Problem. Explore the applet below, and try to come up with a formula for determining whether a graph is planar or not.



The video below shows how to solve this problem in 3D.



This video also does a good job of explaining the formula for finding planar graphs, called Euler's formula.


Back to Top