Upward Three-Dimensional Grid Drawings of Graphs
✍ Scribed by Vida Dujmović; David R. Wood
- Publisher
- Springer Netherlands
- Year
- 2006
- Tongue
- English
- Weight
- 579 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider thre
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 0( n\*) volume. Moreover, we prove that each bipartite graph needs at least a( n3/\*) volume. @