Difference (from prior minor revision)
(author diff)
Changed: 2c2
These graphs are characterized by [Kuratowski's theorem]?.
[Kuratowski's theorem]? provides a characterization of these graphs.
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.