Home / Series / Discrete Mathematics / Aired Order / Season 1 / Episode 21

Planarity—When Can a Graph Be Untangled?

Professor Benjamin introduces the concept of a planar graph, which is a graph that can be drawn on a sheet of paper in such a way that none of its edges cross. Then, encounter the two simplest nonplanar graphs, at least one of which must be contained within any nonplanar graph.

English
  • Runtime 30 minutes
  • Created November 3, 2010 by
    Administrator admin
  • Modified November 3, 2010 by
    Administrator admin