arXiv:2009.05691 [math.CO]AbstractReferencesReviewsResources
Detecting a long even hole
Published 2020-09-12Version 1
For each integer $\ell \geq 4$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $\ell$ and even
Comments: 34 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1904.12273 [math.CO] (Published 2019-04-28)
Detecting a long odd 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