Fan-planarity

CoRR(2015)

引用 24|浏览37
暂无评分
摘要
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt 35], who proved that every n-vertex fan-planar drawing has at most 5 n - 10 edges, and that this bound is tight for n 20 . We extend their result from both the combinatorial and the algorithmic point of view. We prove tight bounds on the density of constrained versions of fan-planar drawings and study the relationship between fan-planarity and k-planarity. Also, we prove that testing fan-planarity in the variable embedding setting is NP-complete.
更多
查看译文
关键词
Edge crossings,Edge density,Graph drawing,Graph planarity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要