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

• Type: Journal
• Year: 2016
• Where: LATIN
• Authors: Kolja Knauer, Bartosz Walczak
• Keywords: Information Technology, LATIN 2016