Detecting an odd hole

Author: 

Chudnovsky, M
Scott, A
Seymour, P
Spirkl, S

Publication Date: 

29 January 2020

Journal: 

Journal of the ACM

Last Updated: 

2020-04-09T18:15:27.417+01:00

Issue: 

1

Volume: 

67

DOI: 

10.1145/3375720

abstract: 

We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.

Symplectic id: 

1070393

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article