Wikipedia: Planar graph

Difference (from prior author revision) (major diff, minor diff)

Changed: 1,3c1,3

A graph that you can draw on a piece of paper where no edges intersect.

See Graph theory

A planar graph is a graph that can be drawn on a piece of paper so that no edges intersect.
[Kuratowski's theorem]? provides a characterization of these graphs.
See Graph theory.

A planar graph is a graph that can be drawn on a piece of paper so that no edges intersect. [Kuratowski's theorem]? provides a characterization of these graphs. See Graph theory.