Skip to main content
Log in

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

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

In this paper we show that, if G is a Berge graph such that neither G nor its complement \( \ifmmode\expandafter\bar\else\expandafter\=\fi{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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michele Conforti.

Additional information

This work was supported in part by NSF grant DMI-0352885 and ONR grant N00014-03-1-0188.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conforti, M., Cornuéjols, G. & Zambelli, G. Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Combinatorica 26, 533–558 (2006). https://doi.org/10.1007/s00493-006-0031-0

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-006-0031-0

Mathematics Subject Classification (2000):

Navigation