Date of Original Version

8-23-2005

Type

Article

Abstract or Description

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.

DOI

10.1137/S089548010444540X

Share

COinS
 

Published In

SIAM J. Discrete Math, 20, 1, 42-48.