@article{Keszegh:129258,
title = {Drawing cubic graphs with at most five slopes},
author = {Keszegh, Balázs and Pach, János and Pálvölgyi, Dömötör and Tóth, Géza},
journal = {Computational Geometry - Theory and Applications},
number = {2},
volume = {40},
pages = {138-147},
year = {2008},
note = {Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.},
abstract = {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.},
url = {http://infoscience.epfl.ch/record/129258},
doi = {10.1016/j.comgeo.2007.05.003},
}