The maximum number of edges in a three-dimensional grid-drawing
Journal of Graph Algorithms and Applications , Volume 8 - Issue 1 p. 21- 26
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.