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

关于(claw, diamond)-自由图的3染色性

On 3-colorability of (claw, diamond)-free graphs

AGH University of Krakow(克拉科夫AGH科技大学);TU Bergakademie Freiberg(弗莱贝格矿业技术大学)

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok, Ingo Schiermeyer

AI总结:

研究了(claw, diamond, N_{i, j, k})-自由图的3-染色性,证明了这些图要么3-可染色,要么包含K_4,或属于特定非3-可染色图类,并指出某些情况下非3-可染色图的数量有限或无限。

摘要:

3-染色性问题是一个著名的NP难问题,且对于(claw, diamond, K_4)-自由图仍然保持NP难。最近,3-染色性问题也被考虑了(claw, N_{1,1,1})-自由图的情况。这里,一般的网N_{i, j, k}是通过将三角形的每个顶点与三个顶点不相交路径的末端顶点相结合而得到的图。我们研究了(claw, diamond, N_{i, j, k})-自由图的类别,其中(i, j, k)∈{(1, 1, 3), (1, 2, 2), (2, 2, 2)}。我们证明这些图是3-可染色的,或者包含K_4,或者属于某些明确定义的非3-可染色图类。此外,我们证明对于任何k≥2,非3-可染色的N_{1, 2, k}-自由图只有有限多个,但存在无限多个非3-可染色的N_{i, j, k}-自由图,对于任何2≤i≤j≤k。

英文摘要:

The $3$-colorability problem is a well-known NP-complete problem and it remains NP-complete for $(claw, diamond, K_4)$-free graphs. Recently, $3$-colorability has been also considered for $(claw, N_{1,1,1})$-free graphs. Here, a generalised net $N_{i, j, k}$ is the graph obtained by identifying each vertex of a triangle with an endvertex of one of three vetex-disjont paths of lengths $i, j, k$. We study the class of $(claw, diamond, N_{i, j, k})$-free graphs for $(i, j, k) \in \{(1, 1, 3),$ $ (1, 2, 2), $ $(2, 2, 2) \}$. We show that these graphs are $3$-colorable or contain a $K_4$ or belong to some well-defined class of non $3$-colorable graphs. Moreover, we prove that there are only finitely many non $3$-colorable $N_{1, 2, k}$-free graphs for any $k \geq 2$, but there exist infinitely many non $3$-colorable $N_{i, j, k}$-free graphs for any $2 \leq i \leq j \leq k.$

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

↑