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

外1-平面图的结构与列表3-动态染色

The structure and the list 3-dynamic coloring of outer-1-planar graphs

Yan Li, Xin Zhang

AI总结:

本文刻画外1-平面图的局部结构,证明其包含十七种最小固定构型,并据此得出最小度至少2的图存在度数和至多9(极大情形为7)的边,且列表3-动态色数至多为6,上界均最优。

摘要:

外1-平面图是一种允许在平面上绘制且所有顶点位于绘图外部区域、每条边至多与另一条边相交的图。本文通过证明每个外1-平面图包含十七种固定构型之一,建立了外1-平面图的局部结构,并且这些构型的列表是最小的,即对于每种固定构型,存在包含该构型但不包含其他十六种构型中任何一种的外1-平面图。该结构定理有两个有趣的应用。首先,我们得出结论:每个(分别为极大的)最小度至少为2的外1-平面图存在一条边,其两个端点的度数之和至多为9(分别为7),且此上界是紧的。另一方面,我们证明每个外1-平面图的列表3-动态色数至多为6,且此上界是最优的。

英文摘要:

An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of another sixteen configurations. There are two interesting applications of this structural theorem. First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp. 7), and this upper bound is sharp. On the other hand, we show that the list 3-dynamic chromatic number of every outer-1-planar graph is at most 6, and this upper bound is best possible.

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

↑