Odd Hole Recognition in Graphs of Bounded Clique Size
Journal Article - Open Access
Carnegie Mellon University Pittsburgh United States
Pagination or Media Count:
In a graph G, an odd hole is an induced odd cycle of length at least five. A clique of G is a set of pairwise adjacent vertices. In this paper we consider the class Ck of graphs whose cliques have a size bounded by a constant k. Given a graph G in Ck, we show how to recognize in polynomial time whether G contains an odd hole.
- Statistics and Probability