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.
Titre
Drawing cubic graphs with at most five slopes
Publié dans
Computational Geometry - Theory and Applications
Volume
40
Numéro
2
Pages
138-147
Date
2008
Note
Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
Date de création de la notice
2008-11-14
