Paper Info
Title
Odd Holes in Bull-Free Graphs
Abstract
AbstractThe 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 isomorphicto the bull (a triangle with two disjoint pendant edges).
Year
DOI
Venue
2018
10.1137/17M1131301
Periodicals
Keywords
DocType
Volume
odd hole,bull-free,algorithm
Journal
32
Issue
ISSN
Citations 
2
0895-4801
0
PageRank 
References 
Authors
0.34
1
2
Name
Order
Citations
PageRank
Maria Chudnovsky139046.13
Vaidy Sivaraman212.72