International Symposium on Graph Drawing

GD 2010: Graph Drawing pp 293-304

Drawing Planar Graphs of Bounded Degree with Few Slopes

  • Balázs Keszegh
  • János Pach
  • Dömötör Pálvölgyi
Conference paper

DOI: 10.1007/978-3-642-18469-7_27

Volume 6502 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Keszegh B., Pach J., Pálvölgyi D. (2011) Drawing Planar Graphs of Bounded Degree with Few Slopes. In: Brandes U., Cornelsen S. (eds) Graph Drawing. GD 2010. Lecture Notes in Computer Science, vol 6502. Springer, Berlin, Heidelberg

Abstract

We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different slopes. If we allow the edges to be represented by polygonal paths with one bend, then 2d slopes suffice. Allowing two bends per edge, every planar graph with maximum degree d ≥ 3 can be drawn using segments of at most ⌈d/2⌉ different slopes. There is only one exception: the graph formed by the edges of an octahedron is 4-regular, yet it requires 3 slopes. These bounds cannot be improved.

Keywords

Graph drawingSlope numberPlanar graphs
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Balázs Keszegh
    • 1
    • 3
  • János Pach
    • 1
    • 3
  • Dömötör Pálvölgyi
    • 1
    • 2
  1. 1.Ecole Politechnique Fédérale de Lausanne 
  2. 2.Eötvös UniversityBudapest
  3. 3.A. Rényi Institute of MathematicsBudapest