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

最小度为3的1-可平面图的轻边

Light edges in 1-planar graphs of minimum degree 3

Bei Niu, Xin Zhang

摘要:

一个图是1-平面的,如果它可以画在平面上,使得每条边至多与另一条边相交。在这项工作中,我们证明了每个1-平面图的最小度至少$3$包含一条边的度的类型为$(3,\leq23)$或$(4,\leq11)$或$(5,\leq9)$或$(6,\leq8)$或$(7,7)$。此外,这里的上界$9,8$和$7$是尖锐的,并且上界$23$和$11$非常接近可能的尖锐值,其分别可以是20和10。这推广了Fabrici和Madaras [离散数学,307(2007)854--865],它指出每个3-连通1-平面图都包含一条轻边,改进了Hudák和Šugerek [Discuss. Math. Graph Theory,32(3)(2012)545- 556],其规定最小度至少为$4$的每个1-平面图包含其端顶点的度为类型$(4,\leq 13)$或$(5,\leq 9)$或$(6,\leq 8)$或$(7, 7)$的边。

英文摘要:

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of type $(3,\leq23)$ or $(4,\leq11)$ or $(5,\leq9)$ or $(6,\leq8)$ or $(7,7)$. Moreover, the upper bounds $9,8$ and $7$ here are sharp and the upper bounds $23$ and $11$ are very close to the possible sharp ones, which may be 20 and 10, respectively. This generalizes a result of Fabrici and Madaras [Discrete Math., 307 (2007) 854--865] which says that each 3-connected 1-planar graph contains a light edge, and improves a result of Hudák and Šugerek [Discuss. Math. Graph Theory, 32(3) (2012) 545--556], which states that each 1-planar graph of minimum degree at least $4$ contains an edge with degrees of its endvertices of type $(4,\leq 13)$ or $(5,\leq 9)$ or $(6,\leq 8)$ or $(7, 7)$.

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

↑