Journal title
Journal of the ACM
DOI
10.1145/3375720
Issue
1
Volume
67
Last updated
2024-04-10T07:59:04.54+01:00
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
On
Favourite
On
Publication type
Journal Article
Publication date
29 Jan 2020