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 | English (US) |
|---|---|
| Article number | 103537 |
| Journal | European Journal of Combinatorics |
| Volume | 104 |
| DOIs | |
| State | Published - Aug 2022 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Detecting a long even hole'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver