Odd hole recognition in graphs of bounded clique size

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 1, 2006, Pages 42-48

  Conforti, Michele ^a   Cornuéjols, Gérard ^b,c   Liu, Xinming ^b   Vušković, Kristina ^d   Zambelli, Giacomo ^e  

^a UNIVERSITY OF PADOVA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c AIX MARSEILLE UNIV   (France)

^d UNIVERSITY OF LEEDS   (United Kingdom)

^e UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cleaning; Decomposition; Odd hole; Recognition algorithm

Indexed keywords

ODD HOLE RECOGNITION; PAIRWISE ADJACENT VERTICES; RECOGNITION ALGORITHMS;

COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

GRAPH THEORY;

EID: 33847656737     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548010444540X     Document Type: Article

References (2)

1. D. BIENSTOCK, On complexity of testing for odd holes and induced odd paths, Discrete Math., 90 (1991), pp. 85-92.
2. M. CHUDNOVSKY, G. CORNUÉJOLS, X. LIU, P. SEYMOUR, AND K. VUŠKOVIĆ, Recognizing Berge graphs, Combinatorica, 25 (2005), pp. 143-186.