Sciweavers

Share
LATIN
2016
Springer

Graph Drawings with One Bend and Few Slopes

4 years 10 months ago
Graph Drawings with One Bend and Few Slopes
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that ∆ 2 edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree ∆ 3. This matches the obvious lower bound. We also show that ∆ 2 + 1 edge slopes suffice for drawings of
Kolja Knauer, Bartosz Walczak
Added 07 Apr 2016
Updated 07 Apr 2016
Type Journal
Year 2016
Where LATIN
Authors Kolja Knauer, Bartosz Walczak
Comments (0)
books