Detecting a long even hole

Abstract

For each integer $\ell \ge 4$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $\ell$ and even

34 pages