id: 05665843
dt: j
an: 05665843
au: Keszegh, Balázs; Pach, János; Pálvölgyi, Dömötör; Tóth, Géza
ti: Cubic graphs have bounded slope parameter.
so: J. Graph Algorithms Appl. 14, No. 1, 5-17 (2010).
py: 2010
pu: Brown University, Providence, RI; University of Texas, Dallas, TX
la: EN
cc: 
ut: drawing of a graph; slope number; slope parameter
ci: 
li: http://www.cs.brown.edu/sites/jgaa/volume14.html
ab: Summary: We show that every finite connected graph $G$ with maximum degree
    three and with at least one vertex of degree smaller than three has a
    straight-line drawing in the plane satisfying the following conditions.
    No three vertices are collinear, and a pair of vertices form an edge in
    $G$ if and only if the segment connecting them is parallel to one of
    the sides of a previously fixed regular pentagon. It is also proved
    that every finite graph with maximum degree three permits a
    straight-line drawing with the above properties using at most seven
    different edge slopes.
rv: