Keszegh, Balázs
Pach, János
Pálvölgyi, Dömötör
Tóth, Géza
Drawing cubic graphs with at most five slopes
Computational Geometry - Theory and Applications
Computational Geometry - Theory and Applications
Computational Geometry - Theory and Applications
Computational Geometry - Theory and Applications
40
2
straight-line drawing
slope number
2008
2008
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.
Computational Geometry - Theory and Applications
Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
Journal Articles
10.1016/j.comgeo.2007.05.003