Drawing cubic graphs with at most five slopes
Keszegh
Balázs
Pach
János
Pálvölgyi
Dömötör
Tóth
Géza
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.
research-article
[
]