Grid drawings of k-colourable graphs
by
David R. Wood
| Venue: | Vida Dujmović and Attila Pór |
| Citations: | 2 - 2 self |
BibTeX
@TECHREPORT{Wood_griddrawings,
author = {David R. Wood},
title = {Grid drawings of k-colourable graphs},
institution = {Vida Dujmović and Attila Pór},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
www.elsevier.com/locate/comgeo 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. © 2004 Elsevier B.V. All rights reserved.
Citations
| 283 | Graph Drawing – Algorithms for the Visualization of Graphs - Battista, Eades, et al. - 1999 |
| 23 | Path-width and three-dimensional straight-line grid drawings of graphs - DUJMOVI'C, MORIN, et al. |
| 21 | On a problem of Heilbronn - Roth |
| 18 | Three-dimensional grid drawings of graphs - Pach, Tóth - 1997 |
| 12 | On a problem of - Roth - 1951 |
| 7 | A dictionary of inequalities - Bullen - 1998 |
| 2 | Dudeney, Amusements in Mathematics - E - 1917 |
