Abstract
An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional grid-drawing contained in a given bounding box. The first universal lower bound on the volume of three-dimensional grid-drawings is obtained as a corollary. Our results generalise to the setting of multi-dimensional polyline grid-drawings.
Original language | English |
---|---|
Pages (from-to) | 21-26 |
Number of pages | 6 |
Journal | Journal of Graph Algorithms and Applications |
Volume | 8 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2004 |
Externally published | Yes |