Chudnovsky, MariaScott, AlexSeymour, PaulSpirkl, Sophie2022-08-122022-08-122020-02https://doi.org/10.1145/3375720http://hdl.handle.net/10012/18527© Maria Chudnovsky, Alex Scott, Paul Seymour, Sophie Spirkl | ACM 2020. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Journal of the ACM, https://doi.org/10.1145/3375720We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.enodd holesperfect graphsrecognition algorithmArticle