arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.02283math.COcs.DM
收藏

无四色$P_6$图。II。找到一个优秀的预着色

Four-coloring $P_6$-free graphs. II. Finding an excellent precoloring

Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong

摘要:

这是一系列两篇论文中的第二篇。本文的目的是对不含导出六点路的图类给出$4$ -染色问题和$4$ -预染色扩张问题的多项式时间算法,从而证明了Huang的一个猜想.结合以前已知的结果,这完成了分类的复杂性的$4$ -着色问题的图与一个连接的禁止诱导子图。在本文中,我们给出了一个多项式时间算法,开始一个$4$ -预着色的图没有诱导六顶点路,并输出一个多项式大小的所谓的优秀预着色的集合。优秀的预着色比一般的预着色更容易处理,此外,为了确定初始预着色是否可以扩展到整个图,只需为集合中的每个优秀预着色回答相同的问题。该系列的第一篇论文涉及优秀的预着色,从而提供了一个完整的解决方案。

英文摘要:

This is the second paper in a series of two. The goal of the series is to give a polynomial time algorithm for the $4$-coloring problem and the $4$-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the $4$-coloring problem for graphs with a connected forbidden induced subgraph. In this paper we give a polynomial time algorithm that starts with a $4$-precoloring of a graph with no induced six-vertex path, and outputs a polynomial-size collection of so-called excellent precolorings. Excellent precolorings are easier to handle than general ones, and, in addition, in order to determine whether the initial precoloring can be extended to the whole graph, it is enough to answer the same question for each of the excellent precolorings in the collection. The first paper in the series deals with excellent precolorings, thus providing a complete solution to the problem.

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

↑