Date of Original Version

12-2003

Type

Article

Abstract or Description

In this paper we show that, if G is a Berge graph such that neither G nor its complement Ḡ 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.

DOI

10.1007/s00493-006-0031-0

Share

COinS
 

Published In

Combinatorica, 26, 5, 533-558.