Sciweavers

Share
COMBINATORICA
2006

Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements

9 years 11 months ago
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G is a basic perfect graph (a bipartite graph, a line graph of a bipartite graph or the complement of such graphs) or it has a skew partition that cannot occur in a minimally imperfect graph. This structural result implies that G is perfect.
Michele Conforti, Gérard Cornuéjols,
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COMBINATORICA
Authors Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Comments (0)
books