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

关于简单4-正则平面图的圈表示的Lovász猜想

On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs

Michael A. Bekos, Chrysanthi N. Raftopoulou

摘要:

Lovász证明了每个连通的4-正则平面图G都有一个实现为一个圆系,即,它可以利用一组圆在平面上绘制,使得G的顶点对应于圆的交点和接触点,并且G的边是圆的交点和接触点对之间的弧段。本文解决了这一猜想。特别地,(a)我们首先提供了任何简单4-正则平面图的实现所需的圈数的严格上界和下界,(b)我们肯定地回答了Lovász猜想,如果G是3-连通的,以及(c)我们证明了一个无限类的简单连通4-正则平面图不是3-连通的(即,或者是单连接的或者是双连接的),并且不允许实现为圆的系统。

英文摘要:

Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of G correspond to the intersection and touching points of the circles and the edges of G are the arc segments among pairs of intersection and touching points of the circles. In this paper, we settle this conjecture. In particular, (a) we first provide tight upper and lower bounds on the number of circles needed in a realization of any simple 4-regular planar graph, (b) we affirmatively answer Lovász's conjecture, if G is 3-connected, and (c) we demonstrate an infinite class of simple connected 4-regular planar graphs which are not 3-connected (i.e., either simply connected or biconnected) and do not admit realizations as a system of circles.

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

↑