论文信息 - Decomposition of odd-hole-free graphs by double star cutsets and 2-joins

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

In this paper we decompose odd-hole-free graphs (graphs that do not contain as an induced subgraph a chordless cycle of odd length greater than three) with double star cutsets and 2-joins into bipartite graphs, line graphs of bipartite graphs and the complements of line graphs of bipartite graphs. ? 2003 Elsevier B.V. All rights reserved.

Gérard Cornuéjols | Michele Conforti | Kristina Vuskovic

[1] Gérard Cornuéjols,et al. Even‐hole‐free graphs part II: Recognition algorithm , 2002, J. Graph Theory.

[2] Gérard Cornuéjols,et al. Perfect Graphs, Partitionable Graphs and Cutsets , 2002, Comb..

[3] Gérard Cornuéjols,et al. Even‐hole‐free graphs part I: Decomposition theorem , 2002, J. Graph Theory.

[4] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.

[5] Gérard Cornuéjols,et al. Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs , 2003, J. Comb. Theory, Ser. B.

[6] Jim Geelen,et al. Matchings, Matroids and Unimodular Matrices , 1995 .

[7] Klaus Truemper,et al. Alpha-balanced graphs and matrices and GF(3)-representability of matroids , 1982, J. Comb. Theory, Ser. B.

[8] R. Bixby. A Composition for Perfect Graphs , 1984 .