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 threedimensional grid-drawings is obtained as a corollary. Our results generalise to the setting of multi-dimensional polyline grid-drawings.
|Title of host publication||Graph Algorithms and Applications 5|
|Publisher||World Scientific Publishing|
|Number of pages||6|
|ISBN (Print)||981256845X, 9789812568458|
|Publication status||Published - 1 Jan 2006|