2 search results - page 1 / 1 » Decomposing Berge graphs and detecting balanced skew partiti... |
JCT
2008
13 years 4 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
COMBINATORICA
2006
13 years 4 months ago
2006
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 i...