Detecting even holes

Journal of Graph Theory

Volumn 48, Issue 2, 2005, Pages 85-111

  Chudnovsky, Maria ^a   Kawarabayashi, Ken Ichi ^b   Seymour, Paul ^a  

^a PRINCETON UNIVERSITY   (United States)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Even hole; Recognition algorithm; Signed graph

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

EVEN HOLES; RECOGNITION ALGORITHMS; SIGNED GRAPHS; SUBGRAPHS;

GRAPH THEORY;

EID: 13444301084     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20040     Document Type: Article

References (3)

1. M. Chudnovsky, G. Cornuéjols, X. Liu, P. Seymour, and K. Vušković, Recognizing Berge graphs, submitted Combinatorica, November 2002.
2. M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vušković, Even-hole-free graphs. Part I: Decomposition theorem, J Graph Theory 39 (2002), 6-49.
3. M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vušković, Even-hole-free graphs. Part II: Recognition algorithm, J Graph Theory 40 (2002), 238-266.