Resource title

Decomposing berge graphs containing no proper wheels, long prisms or their complements

Resource image

image for OpenScout resource :: Decomposing berge graphs containing no proper wheels,
long prisms or their complements

Resource 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.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/31699/

Resource license