Abstract
We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice.
References
Barát, J., Matoušek, J., Wood, D.: Bounded-degree graphs have arbitrarily large geometric thickness. Electronic J. Combinatorics 13(1), R3 (2006)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)
Dujmović, V., Suderman, M., Wood, D.R.: Really straight graph drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 122–132. Springer, Heidelberg (2005)
Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proc. 20th ACM Symp. on Computational Geometry (SoCG’04), pp. 340–346. ACM Press, New York (2004)
Engelstein, M.: Drawing graphs with few slopes. Research paper submitted to the Intel Competition for high school students, New York, (October 2005)
Eppstein, D.: Separating thickness from geometric thickness. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs Contemporary Mathematics 342, pp. 75–86. Amer. Math. Soc, Providence (2004)
Pach, J., Pálvölgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electronic J. Combinatorics 13(1), N1 (2006)
Ungar, P.: On diagrams representing maps. J. London Math. Soc. 28, 336–342 (1953)
Wade, G.A., Chu, J.H.: Drawability of complete graphs using a minimal slope set. The Computer J. 37, 139–142 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Keszegh, B., Pach, J., Pálvölgyi, D., Tóth, G. (2007). Drawing Cubic Graphs with at Most Five Slopes. In: Kaufmann, M., Wagner, D. (eds) Graph Drawing. GD 2006. Lecture Notes in Computer Science, vol 4372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-70904-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70903-9
Online ISBN: 978-3-540-70904-6
eBook Packages: Computer ScienceComputer Science (R0)