arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.16191cs.DM
收藏

从三脚架到双足架:将平面图的队列数减少仅需一条腿

From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg

Henry Förster

AI总结:

本文提出一种新的平面图乘积结构定理,将平面图嵌入$K_2$、路径与$4$-树子图的强乘积中,从而将平面图队列数上界降至38,二部平面图降至25。

摘要:

作为对先前存在的平面图乘积结构定理的替代,我们证明了每个平面图$G$都是$K_2$、一条路径和一个$4$-树的平面子图的强乘积的子图。作为应用,我们证明了平面图的队列数至多为$38$,而平面二部图的队列数至多为$25$。

英文摘要:

As an alternative to previously existing planar graph product structure theorems, we prove that every planar graph $G$ is a subgraph of the strong product of $K_2$, a path and a planar subgraph of a $4$-tree. As an application, we show that the queue number of planar graphs is at most $38$ whereas the queue number of planar bipartite graphs is at most $25$.

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

↑