Abstract
Purchase PDF (438 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (11)
Purchase PDF (801 K)
doi:10.1016/S0020-0190(97)00098-7 
Copyright © 1997 Published by Elsevier Science B.V.
3D straight-line grid drawing of 4-colorable graphs
Received 20 June 1996;
revised 28 February 1997.
Communicated by M.T. Goodrich
Available online 13 May 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in O(n2) volume. Moreover, we prove that each bipartite graph needs at least Ω(n3/2) volume.
Author Keywords: Computational geometry; Straight-line grid drawing; k-colorable graphs
