Journal title
Combinatorica
DOI
10.1007/s00493-020-4301-z
Issue
1
Volume
41
Last updated
2024-09-16T03:12:39.36+01:00
Page
1-30
Abstract
For each integer ℓ ≥ 5, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least ℓ and odd.
Symplectic ID
1130792
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
26 Nov 2020