doi:10.1016/j.comgeo.2007.05.003
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
http://infoscience.epfl.ch/record/129258/files/Keszegh_2008_Computational-Geometry.pdf
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.
2008-11-14T14:28:43Z
http://infoscience.epfl.ch/record/129258
http://infoscience.epfl.ch/record/129258
Text