Detecting an Odd Hole
MetadataShow full item record
We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.
Cite this version of the work
Maria Chudnovsky, Alex Scott, Paul Seymour, Sophie Spirkl (2020). Detecting an Odd Hole. UWSpace. http://hdl.handle.net/10012/18527