Papers
Topics
Authors
Recent
Search
2000 character limit reached

Drawing Planar Graphs with Many Collinear Vertices

Published 13 Jun 2016 in cs.CG and math.CO | (1606.03890v4)

Abstract: Consider the following problem: Given a planar graph GG, what is the maximum number pp such that GG has a planar straight-line drawing with pp collinear vertices? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity. The following results are known for it: Every nn-vertex planar graph has a planar straight-line drawing with Ω(n)\Omega(\sqrt{n}) collinear vertices; for every nn, there is an nn-vertex planar graph whose every planar straight-line drawing has O(nσ)O(n^\sigma) collinear vertices, where σ<0.986\sigma<0.986; every nn-vertex planar graph of treewidth at most two has a planar straight-line drawing with Θ(n)\Theta(n) collinear vertices. We extend the linear bound to planar graphs of treewidth at most three and to triconnected cubic planar graphs. This (partially) answers two open problems posed by Ravsky and Verbitsky [WG 2011:295--306]. Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs. For planar graphs of treewidth at most three, our results also imply asymptotically tight bounds for all of the other above mentioned graph drawing problems.

Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.