Drawing cubic graphs with at most five slopes

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.


Published in:
Computational Geometry - Theory and Applications, 40, 2, 138-147
Year:
2008
Keywords:
Note:
Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
Laboratories:




 Record created 2008-11-14, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)