arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.05161cs.DM
收藏

关于1-平面图边划分的新结果

New Results on Edge Partitions of 1-plane Graphs

Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath

摘要:

$1$ -平面图是嵌入在平面中的图,使得每条边最多交叉一次。一个NIC-平面图是一个$1$ -平面图,使得任何两对交叉边最多共享一个端点。$1$ -平面图$G$的边划分是用红色和蓝色两种颜色对$G$的边进行着色,使得由红色边导出的图和由蓝色边导出的图都是平面图。我们证明如下:$(i)$每个NIC平面图都有一个边划分,使得红色图的最大顶点度为3;顶点度的这个界是最坏情况下的最优。$(ii)$判定一个$1$ -平面图是否允许边划分使得红色图的最大顶点度为2是NP-完全的。$(iii)$判定一个$1$ -平面图是否允许一个边划分使得红色图的顶点度最大为1,并且在正的情况下计算顶点度1,可以在二次时间内完成。本文还讨论了这些结果在绘图中的应用。

英文摘要:

A $1$-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a $1$-plane graph $G$ is a coloring of the edges of $G$ with two colors, red and blue, such that both the graph induced by the red edges and the graph induced by the blue edges are plane graphs. We prove the following: $(i)$ Every NIC-plane graph admits an edge partition such that the red graph has maximum vertex degree three; this bound on the vertex degree is worst-case optimal. $(ii)$ Deciding whether a $1$-plane graph admits an edge partition such that the red graph has maximum vertex degree two is NP-complete. $(iii)$ Deciding whether a $1$-plane graph admits an edge partition such that the red graph has maximum vertex degree one, and computing one in the positive case, can be done in quadratic time. Applications of these results to graph drawing are also discussed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑