research article
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.
Type
research article
Author(s)
Date Issued
2008
Published in
Volume
40
Issue
2
Start page
138
End page
147
Subjects
Note
Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
Available on Infoscience
November 14, 2008
Use this identifier to reference this record