Detecting a long even hole

Linda Cook, Paul Seymour

Research output: Contribution to journalArticlepeer-review


For each integer ℓ≥4, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least ℓ and even.

Original languageEnglish (US)
Article number103537
JournalEuropean Journal of Combinatorics
StatePublished - Aug 2022

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Detecting a long even hole'. Together they form a unique fingerprint.

Cite this