Abstract
For each integer ℓ≥4, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least ℓ and even.
Original language | American English |
---|---|
Article number | 103537 |
Journal | European Journal of Combinatorics |
Volume | 104 |
DOIs | |
State | Published - Aug 2022 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics