TY - EJOUR
DO - 10.1016/j.comgeo.2007.05.003
AB - 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.
T1 - Drawing cubic graphs with at most five slopes
IS - 2
DA - 2008
AU - Keszegh, Balázs
AU - Pach, János
AU - Pálvölgyi, Dömötör
AU - Tóth, Géza
JF - Computational Geometry - Theory and Applications
SP - 138-147
VL - 40
EP - 138-147
N1 - Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
ID - 129258
KW - straight-line drawing
KW - slope number
UR - http://infoscience.epfl.ch/record/129258/files/Keszegh_2008_Computational-Geometry.pdf
ER -