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

无牛图中的奇洞

Odd holes in bull-free graphs

Maria Chudnovsky, Vaidy Sivaraman

摘要:

测试图是否包含长度至少为5的诱导奇循环的复杂性目前尚不清楚。在本文中,我们表明,这可以在多项式时间内完成,如果输入图没有诱导子图同构的公牛(三角形与两个不相交的悬垂边)。

英文摘要:

The complexity of testing whether a graph contains an induced odd cycle of length at least five is currently unknown. In this paper we show that this can be done in polynomial time if the input graph has no induced subgraph isomorphic to the bull (a triangle with two disjoint pendant edges).

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

↑