Detecting a long odd hole
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.
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Springer
2020
|
| Summary: | 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. |
|---|