Abstract
A three-dimensional grid drawing of a, graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is shown that for any fixed r ≥ 2) every r-colorable graph of n vertices has a threedimensional grid drawing that fits into a box of volume O(n2). The order of magnitude of this bound cannot be improved.
Cite
CITATION STYLE
Pach, J., Thiele, T., & Tóth, G. (1997). Three-dimensional grid drawings of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 47–51). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
