Graph Drawings with One Bend and Few Slopes

Abstract : 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 outerpla-nar graphs with maximum degree ∆ 3. This matches the obvious lower bound. We also show that ∆ 2 + 1 edge slopes suffice for drawings of general graphs, improving on the previous bound of ∆ + 1. Furthermore, we improve previous upper bounds on the number of slopes needed for planar drawings of planar and bipartite planar graphs.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01457778
Contributor : Kolja Knauer <>
Submitted on : Wednesday, February 8, 2017 - 11:00:28 AM
Last modification on : Saturday, August 24, 2019 - 1:17:01 AM
Long-term archiving on : Tuesday, May 9, 2017 - 12:11:46 PM

File

latin-onebendslope.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Kolja Knauer, Bartosz Walczak. Graph Drawings with One Bend and Few Slopes. LATIN 2016, Apr 2016, Ensenada, Mexico. pp.549 - 561, ⟨10.1007/978-3-662-49529-2_41⟩. ⟨hal-01457778⟩

Share

Metrics

Record views

106

Files downloads

110