Journal article
Detecting a long odd hole
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 310.8KB, Terms of use)
-
- Publisher copy:
- 10.1007/s00493-020-4301-z
Authors
- Publisher:
- Springer
- Journal:
- Combinatorica More from this journal
- Volume:
- 41
- Issue:
- 1
- Pages:
- 1-30
- Publication date:
- 2020-11-26
- Acceptance date:
- 2020-05-19
- DOI:
- EISSN:
-
1439-6912
- ISSN:
-
0209-9683
- Language:
-
English
- Keywords:
- Pubs id:
-
1130792
- Local pid:
-
pubs:1130792
- Deposit date:
-
2020-09-06
- ARK identifier:
Terms of use
- Copyright holder:
- János Bolyai Mathematical Society and Springer-Verlag
- Copyright date:
- 2020
- Rights statement:
- © 2020, János Bolyai Mathematical Society and Springer-Verlag.
- Notes:
- This is the accepted manuscript version of the article. The final version is available online from Springer at https://doi.org/10.1007/s00493-020-4301-z
If you are the owner of this record, you can report an update to it here: Report update to this record