The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
- First Online:
- 107 Downloads
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with maximum degree Δ. We show that the planar slope number of every planar partial 3-tree and also every plane partial 3-tree is at most O(Δ5). In particular, we answer the question of Dujmović et al. (Comput Geom 38(3):194–212, 2007) whether there is a function f such that plane maximal outerplanar graphs can be drawn using at most f(Δ) slopes.
KeywordsGraph drawing Planar graphs Slopes Planar slope number
Mathematics Subject Classification68R10 05C10 05C62
Unable to display preview. Download preview PDF.