[Home]Planar graph

HomePage | Recent Changes | Preferences

Showing revision 2
A planar graph is a graph that can be drawn on a piece of paper so that no edges intersect. These graphs are characterized by [Kuratowski's theorem]?. See Graph theory.

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