Drawing cubic graphs with at most five slopes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4372 LNCS, Issue , 2007, Pages 114-125

  Keszegh, B ^a   Pach, J ^b,d   Palvolgyi D ^c   Toth G ^d  

^a CENTRAL EUROPEAN UNIVERSITY   (Hungary)

^b NEW YORK UNIVERSITY   (United States)

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

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

Author keywords

[No Author keywords available]

Indexed keywords

EDGE DETECTION;

CUBIC GRAPHS; STRAIGHT-LINE DRAWING;

GRAPH THEORY;

EID: 38149088945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_13     Document Type: Conference Paper

References (9)

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, Prentice Hall, Upper Saddle River, N.J., 1999.
3. V. Dujmović, M. Suderman, and D.R. Wood: Really straight graph drawings, in: Graph Drawing (GD'04), J. Pach, ed., Lecture Notes in Computer Science 3383, Springer-Verlag, Berlin, 2005, 122-132.
4. C. A. Duncan, D. Eppstein, and S.G. Kobourov: The geometric thickness of low degree graphs, in: Proc. 20th ACM Symp. on Computational Geometry (SoCG'04), ACM Press, 2004, 340-346.
5. M. Engelstein: Drawing graphs with few slopes, Research paper submitted to the Intel Competition for high school students, New York, October 2005.
6. D. Eppstein: Separating thickness from geometric thickness, in: Towards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics 342, Amer. Math. Soc, Providence, 2004, 75-86.
7. J. Pach and D. Pálvölgyi: Bounded-degree graphs can have arbitrarily large slope numbers, Electronic J. Combinatorics 13/1 (2006), N1.
8. P. Ungar: On diagrams representing maps, J. London Math. Soc. 28 (1953), 336-342.
9. G. A. Wade and J. H. Chu: Drawability of complete graphs using a minimal slope set, The Computer J. 37 (1994), 139-142.