Straight-line realization of planar graphs.
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar if and only if it has no subgraph homeomorphic to K₅ or K₃,₃. It has remained as a direct criterion for determining whether a graph is planar or not. Powerful as the theorem is, it is not always easy...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2429/34212 |