The Maximum Number of Edges in a Three-Dimensional Grid-Drawing

Authors

  • Prosenjit Bose
  • Jurek Czyzowicz
  • Pat Morin
  • David Wood

DOI:

https://doi.org/10.7155/jgaa.00079

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.

Downloads

Download data is not yet available.

Downloads

Published

2004-01-01

How to Cite

Bose, P., Czyzowicz, J., Morin, P., & Wood, D. (2004). The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. Journal of Graph Algorithms and Applications, 8(1), 21–26. https://doi.org/10.7155/jgaa.00079

Issue

Vol. 8 No. 1 (2004)

Section

Articles

Categories

License

Copyright (c) 2004 Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David Wood

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.