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
Computational Geometry - Theory and Applications
10.1016/j.comgeo.2007.05.003
40
2
138-147
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.
straight-line drawing;
slope number;
2008
http://infoscience.epfl.ch/record/129258/files/Keszegh_2008_Computational-Geometry.pdf;