2015/06/14 by Knauer, Kolja, Walczak, Bartosz · 1 citation
#05C62 #68R10 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1506.04423
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 \lceil\fracΔ2\rceil edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree Δ≥ 3. This matches the obvious lower bound. We also show that \lceil\fracΔ2\rceil+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.