Abstract
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 . In particular, we answer the question of Dujmović et al. [Computational Geometry 38 (3), pp. 194--212 (2007)] whether there is a function such that plane maximal outerplanar graphs can be drawn using at most slopes.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.