A description of claw-free perfect graphs
Journal of Combinatorial Theory Series B
A Mickey-Mouse Decomposition Theorem
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Even and odd holes in cap-free graphs
Journal of Graph Theory
A class of perfect graphs containing P6
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Graphs of separability at most 2
Discrete Applied Mathematics
On graphs with no induced subdivision of K4
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We prove that the strong perfect graph conjecture holds for graphs that do not contain parachutes or proper wheels. This is done by showing the following theorem: If a graph G contains no odd hole, no parachute and no proper wheel, then G is bipartite or the line graph of a bipartite graph or G contains a star cutset or an extended strong 2-join or G is disconnected.To prove this theorem, we prove two decomposition theorems which are interesting in their own rights. The first is a generalization of the Burlet-Fonlupt decomposition of Meyniel graphs by clique cutsets and amalgams. The second is a precursor of the recent decomposition theorem of Chudnovsky, Robertson, Seymour and Thomas for Berge graphs that contain a line graph of a bipartite subdivision of a 3-connected graph.