arXiv:1904.12273 Abstract | arXiv Analytics

Published 2019-04-28Version 1

For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.

Categories: math.CO

Keywords: long odd hole, polynomial-time algorithm, graph contains, induced cycle

Related articles: Most relevant | Search more

arXiv:2009.05691 [math.CO] (Published 2020-09-12)

Detecting a long even hole

arXiv:1707.08918 [math.CO] (Published 2017-07-27)

Coloring ($P_5$, bull)-free graphs

arXiv:1511.08911 [math.CO] (Published 2015-11-28)

4-coloring ($P_6$, bull)-free graphs