Decomposition of odd-hole-free graphs by double star cutsets and 2-joins

Discrete Applied Mathematics

Volumn 141, Issue 1-3, 2004, Pages 41-91

  Conforti, Michele ^a   Cornuéjols, Gérard ^b,c   Vušković, Kristina ^d  

^a UNIVERSITY OF PADOVA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c AIX MARSEILLE UNIV   (France)

^d UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

2 join; Decomposition; Double star cutset; Even signable graphs; Odd hole free graphs

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DECOMPOSITION THEOREM; DOUBLE STAR CUTSET; EVEN-SIGNABLE GRAPHS; ODD-HOLE-FREE GRAPHS;

GRAPH THEORY;

EID: 2942574601     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00364-0     Document Type: Conference Paper

References (12)

1. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, preprint, 2002.
2. Chvátal V. Star-cutsets and perfect graphs. J. Combin. Theory B. 39:1985;189-199.
3. Conforti M., Cornuéjols G. Graphs without odd holes, parachutes or proper wheels. a generalization of Meyniel graphs and of line graphs of bipartite graphs J. Combin. Theory B. 87:2003;300-330.
4. Conforti M., Cornuéjols G., Gasparyan G., Vušković K. Perfect graphs, partitionable graphs and cutsets. Combinatorica. 22:2002;19-33.
5. Conforti M., Cornuéjols G., Kapoor A., Vušković K. A Mickey mouse decomposition theorem. Balas E., Clausen J. Proceedings of the Fourth International Integer Programming and Combinatorial Optimization Conference, Copenhagen, Denmark. Lecture Notes in Computer Science. Vol. 920:1995;321-328 Springer, Berlin.
6. Conforti M., Cornuéjols G., Kapoor A., Vušković K. Even-hole-free graphs, Part I: decomposition theorem. J. Graph Theory. 39:2002;6-49.
7. Conforti M., Cornuéjols G., Kapoor A., Vušković K. Even-hole-free graphs, Part II: recognition algorithm. J. Graph Theory. 40:2002;238-266.
8. M. Conforti, G. Cornuéjols, K. Vušković, Square-free perfect graphs, J. Combin. Theory B, to appear, 2001.
9. Cornuéjols G., Cunningham W.H. Composition for perfect graphs. Discrete Math. 55:1985;245-254.
10. J.F. Geelen, Matchings, Matroids and unimodular matrices, Ph.D. Thesis, University of Waterloo, 1995.
11. A. Kapoor, On the structure of balanced matrices and perfect graphs, Ph.D. Thesis, Carnegie Mellon University, 1994.
12. Truemper K. Alpha-balanced graphs and matrices and GF(3)-representability of matroids. J. Combin. Theory B. 32:1982;112-139.