Detecting a long even hole

Linda Cook, Paul Seymour

Research output: Contribution to journalArticlepeer-review

Abstract

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 languageAmerican English
Article number103537
JournalEuropean Journal of Combinatorics
Volume104
DOIs
StatePublished - Aug 2022

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

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

Cite this