Abstract
The complexity of testing whether a graph contains an induced odd cycle of length at least five is currently unknown. In this paper we show that this test can be done in polynomial time if the input graph has no induced subgraph isomorphic to the bull (a triangle with two disjoint pendant edges).
Original language | English (US) |
---|---|
Pages (from-to) | 951-955 |
Number of pages | 5 |
Journal | SIAM Journal on Discrete Mathematics |
Volume | 32 |
Issue number | 2 |
DOIs | |
State | Published - 2018 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Keywords
- Algorithm
- Bull-free
- Odd hole