UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Detecting an Odd Hole

Thumbnail Image

Files

1903.00208.pdf (203.5 KB)

Date

2020-02

Authors

Chudnovsky, Maria
Scott, Alex
Seymour, Paul
Spirkl, Sophie

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

LC Keywords

Citation

URI

https://doi.org/10.1145/3375720
 http://hdl.handle.net/10012/18527

Collections

Waterloo Research
Combinatorics and Optimization