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.
| Original language | English (US) |
|---|---|
| Journal | Combinatorica |
| Volume | 41 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 2021 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics