@article{073421a5bd3b474ba47bc0b16b7c358c,
title = "Detecting a long even hole",
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.",
author = "Linda Cook and Paul Seymour",
note = "Funding Information: This work was partially supported by AFOSR, USA grant A9550-19-1-0187 and NSF grant DMS-1800053. Additionally, Linda Cook was partially supported by the Institute for Basic Science, Repubic of Korea (IBS-R029-C1). Publisher Copyright: {\textcopyright} 2022 Elsevier Ltd",
year = "2022",
month = aug,
doi = "10.1016/j.ejc.2022.103537",
language = "English (US)",
volume = "104",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
}