Drawing cubic graphs with at most five slopes

Computational Geometry: Theory and Applications

Volumn 40, Issue 2, 2008, Pages 138-147

  Keszegh, Balázs ^a   Pach, János ^b   Pálvölgyi, Dömötör ^c   Tóth, Géza ^d  

^a CENTRAL EUROPEAN UNIVERSITY   (Hungary)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^d ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

Slope number; Straight line drawing

Indexed keywords

EID: 84867968002     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.05.003     Document Type: Article

References (12)

1. J. Barát, J. Matoušek, and D. Wood Bounded-degree graphs have arbitrarily large geometric thickness Electronic J. Combinatorics 13 1 2006 R3
2. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Graph Drawing 1999 Prentice Hall Upper Saddle River, N.J.
3. V. Dujmović, D. Eppstein, M. Suderman, and D.R. Wood Drawings of planar graphs with few slopes and segments Computational Geometry: Theory and Applications 38 3 2007 194 212
4. V. Dujmović, M. Suderman, and D.R. Wood Really straight graph drawings J. Pach, Graph Drawing (GD'04) Lecture Notes in Computer Science vol. 3383 2005 Springer Berlin 122 132
5. V. Dujmović, M. Suderman, and D.R. Wood Graph drawings with few slopes Computational Geometry: Theory and Applications 38 3 2007 181 193
6. C.A. Duncan, D. Eppstein, and S.G. Kobourov The geometric thickness of low degree graphs Proc. 20th ACM Symp. on Computational Geometry (SoCG'04) 2004 ACM Press New York 340 346
7. M. Engelstein, Drawing graphs with few slopes, Research paper submitted to the Intel Competition for high school students, New York, October 2005
8. D. Eppstein Separating thickness from geometric thickness J. Pach, Towards a Theory of Geometric Graphs Contemporary Mathematics vol. 342 2004 Amer. Math. Soc Providence, RI 75 86
9. B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth Drawing cubic graphs with at most five slopes Graph Drawing 2006 Lecture Notes in Computer Science vol. 4372 2007 Springer Berlin 114 125
10. J. Pach, and D. Pálvölgyi Bounded-degree graphs can have arbitrarily large slope numbers Electronic J. Combinatorics 13 1 2006 N1
11. P. Ungar On diagrams representing maps J. London Math. Soc. 28 1953 336 342
12. G.A. Wade, and J.H. Chu Drawability of complete graphs using a minimal slope set The Computer J. 37 1994 139 142