3 research outputs found
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
The of a planar graph is the
minimum number of edge slopes in a planar straight-line drawing of . It is
known that for every planar graph of maximum
degree . This upper bound has been improved to if has
treewidth three, and to if has treewidth two. In this paper we
prove when is a Halin graph, and thus has
treewidth three. Furthermore, we present the first polynomial upper bound on
the planar slope number for a family of graphs having treewidth four. Namely we
show that slopes suffice for nested pseudotrees.Comment: Extended version of "Planar Drawings with Few Slopes of Halin Graphs
and Nested Pseudotrees" appeared in the Proceedings of the 17th Algorithms
and Data Structures Symposium (WADS 2021
Graph Drawings with One Bend and Few Slopes
International audienceWe 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