Detecting an Odd Hole
Loading...
Date
2020-02
Authors
Chudnovsky, Maria
Scott, Alex
Seymour, Paul
Spirkl, Sophie
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery
Abstract
We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.
Description
© 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/3375720
Keywords
odd holes, perfect graphs, recognition algorithm