| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10327470 | Computational Geometry | 2005 | 4 Pages |
Abstract
It is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area, and that this bound is best possible. This result can be viewed as a generalisation of the no-three-in-line problem. A further area bound is established that includes the aspect ratio as a parameter.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
David R. Wood,