Odd Hole Recognition in Graphs of Bounded Clique Size.pdf.pdf' (142.8 kB)
Odd Hole Recognition in Graphs of Bounded Clique Size
journal contribution
posted on 2009-10-01, 00:00 authored by Michele Conforti, Gerard CornuejolsGerard Cornuejols, Xinming Liu, Kristina Vušković, Giacomo ZambelliIn 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.