The geometric thickness of low degree graphs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 340-346

  Duncan, Christian A ^a   Eppstein, David ^b   Kobourov, Stephen G ^c  

^a Department of Computer Science and Center for Computational Science   (United States)

^b Irvine   (United States)

^c University of Arizona   (United States)

Author keywords

Geometric thickness; Graph drawing; Graph thickness; Layered graphs; Rectangle visibility; Simultaneous embeddings

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; LOGIC DESIGN; PROBLEM SOLVING; VLSI CIRCUITS;

GEOMETRIC THICKNESS; GRAPH DRAWING; GRAPH THICKNESS; LAYERED GRAPHS; RECTANGLE VISIBILITY; SIMULTANEOUS EMBEDDINGS;

GRAPH THEORY;

EID: 4544290539     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997868     Document Type: Conference Paper

References (20)

1. Aggarwal, Klawe, and Shor. Multilayer grid embeddings for VLSI. Algorithmica, 6:129-151, 1991.
2. J. Akiyama. A status on the linear arboricity. In N. Saito and T. Nishizeki, editors, 17th Symposium of Research Institute of Electrical Communication on Graph Theory and Algorithms, volume 108 of LNCS, pages 38-44, 1980.
3. J. Akiyama, G. Exoo, and F. Harary. Covering and packing in graphs. III. Cyclic and acyclic invariants. Math. Slovaca, 30(4):405-417, 1980.
4. J. Akiyama, G. Exoo, and F. Harary. Covering and packing in graphs. IV. Linear arboricity. Networks, 11(1):69-72, 1981.
5. N. Alon. The linear arboricity of graphs. Israel J. Math., 62(3):311-325, 1988.
6. N. Alon, V. J. Teague, and N. C. Wormald, Linear arboricity and linear k-arboricity of regular graphs. Graphs Combin., 17(1):11-16, 2001.
7. F. Bernhart and P. C. Kainen. The book thickness of a graph. J. Combin. Theory, Ser. B 27:320-331, 1979.
8. P. Bose, A. M. Dean, J. P. Hutchinson, and T. C. Shermer. On rectangle visibility graphs. In S. C. North, editor, Proc. Int. Symp. Graph Drawing, GD '96, volume 1190 of Lecture Notes in Computer Science, pages 25-44. Springer, 1997.
9. P. Brass, E. Cenek, C. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. Kobourov, A. Lubiw, and J. Mitchell. On simultaneous planar graph embeddings. In 8th Workshop on Algorithms and Data Structures (WADS), volume 2748 of LNCS, pages 243-255, 2003.
10. C. Collberg, S. G. Kobourov, J. Nagra, J. Pitts, and K. Wampler. A system for graph-based visualization of the evolution of software. In ACM Symposium on Software Visualization (SoftVis), pages 77-86, 2003.
11. H. S. M. Coxeter. My graph. Proc. London Math. Soc., 46:117-136, 1983.
12. M. B. Dillencourt, D. Eppstein, and D. S. Hirschberg. Geometric thickness of complete graphs. Journal of Graph Algorithms and Applications, 4(3):5-17, 2000.
13. D. Eppstein. Separating geometric thickness from book thickness. arXiv:math/0109195, http://arXiv.org/abs/math/0109195, Sept. 24 2001.
14. D. Eppstein. Separating thickness from geometric thickness. In Proc. 10th Int. Symp. Graph Drawing, GD, pages 150-161, 2002.
15. C. Erten, S. G. Kobourov, A. Navabia, and V. Le. Simultaneous graph drawing: Layout algorithms and visualization schemes. In Proc. 11th Int. Symp. Graph Drawing, GD '03, volume 2912 of Lecture Notes in Computer Science, LNCS, pages 437-449. Springer-Verlag, 2004.
16. P. C. Kainen. Thickness and coarseness of graphs. Abh. Math. Sem. Univ. Hamburg, 39:88-95, 1973.
17. P. Mutzel, T. Odenthal, and M. Scharbrodt. The thickness of graphs: a survey. Graphs Combin., 14(1):59-73, 1998.
18. J. Pach and R. Wenger. Embedding planar graphs at fixed vertex locations. In S. H. Whitesides, editor, Proc. 6th Int. Symp. Graph Drawing, GD, volume 1547 of Lecture Notes in Computer Science, LNCS, pages 263-274. Springer-Verlag, 13-15 Aug. 1998.
19. D. B. West. Introduction to graph theory. Prentice Hall Inc., Upper Saddle River, NJ, 1996.
20. D. R. Wood. Geometric thickness in a grid. Discrete Mathematics, 273:221-234, 2003.