Odd holes in bull-free graphs
Combinatorics
2017-04-17 v1 Discrete Mathematics
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 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).
Keywords
Cite
@article{arxiv.1704.04262,
title = {Odd holes in bull-free graphs},
author = {Maria Chudnovsky and Vaidy Sivaraman},
journal= {arXiv preprint arXiv:1704.04262},
year = {2017}
}