@article{Knauer:198560,
title = {Outerplanar graph drawings with few slopes},
author = {Knauer, Kolja and Micek, Piotr and Walczak, Bartosz},
publisher = {Elsevier Science Bv},
journal = {Computational Geometry-Theory And Applications},
address = {Amsterdam},
number = {5},
volume = {47},
pages = {11. 614-624},
year = {2014},
abstract = {We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that Delta - 1 edge slopes suffice for every outerplanar graph with maximum degree Delta >= 4. This improves on the previous bound of O(Delta(5)), which was shown for planar partial 3-trees, a superclass of outerplanar graphs. The bound is tight: for every Delta >= 4 there is an outerplanar graph with maximum degree Delta that requires at least Delta - 1 distinct edge slopes in an outerplanar straight-line drawing. (C) 2014 Elsevier B.V. All rights reserved.},
url = {http://infoscience.epfl.ch/record/198560},
doi = {10.1016/j.comgeo.2014.01.003},
}