On the Crossing Numbers of Complete Graphs
In this thesis we prove two main results. The Triangle Conjecture asserts that the convex hull of any optimal rectilinear drawing of <em>K<sub>n</sub></em> must be a triangle (for <em>n</em> ≥ 3). We prove that, for the larger class of pseudolinear dr...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Waterloo
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/1174 |