[Home]Planar graph

HomePage | Recent Changes | Preferences

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.

HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited October 23, 2001 9:28 am by AxelBoldt (diff)
Search: