Skip to main content
SpringerLink
Log in

Perfect graphs with noP 5 and noK 5

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We prove that Berge’s Strong Perfect Graph Conjecture is true for graphs with no induced path on five vertices and no clique of size five.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bacsó, G.: Alpha-critical edges in perfect graphs (in Hungarian). Manuscript, Eötvös Loránd University, Budapest, Hungary, 1989

    Google Scholar 

  2. Berge, C.: Les problèmes de coloration en théorie des graphes. Publ. Inst. Stat. Univ. Paris,9,123–160(1960)

    MATH  MathSciNet  Google Scholar 

  3. Berge, C.: Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung). Wiss. Z. Martin Luther Univ. Math.-Natur. Reihe,10, 114–115 (1961)

    Google Scholar 

  4. Berge, C: Graphs. North-Holland, Amsterdam/New York, 1985

  5. Bland, R.G., Huang, H.-C, Trotter, L.E.: Graphical properties related to minimal imperfection. Discrete Math.27, 11–22 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Giles, R., Trotter, L.E., Tucker, ?.: The strong perfect graph theorem for a class of partitionable graphs. In Topics on perfect graphs, Berge, C. and Chvátal, V., editors, pages 161–167. North-Holland, Amsterdam, 1984

    Chapter  Google Scholar 

  7. Grötschel, M., Lovász, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In C. Berge and V. Chvátal, editors, Topics on Perfect Graphs (Ann. Discrete Math. 21), pages 325–356. North-Holland, Amsterdam, 1984

    Chapter  Google Scholar 

  8. Lovász, L.: A characterization of perfect graphs. J. Comb. Theory, Ser B13,95–98 (1972)

    Article  MATH  Google Scholar 

  9. Lovász, L.: Normal hypergraphs and the perfect graph conjecture. Dicrete Math.2, 253–267 (1972)

    Article  MATH  Google Scholar 

  10. Markosian, S.E., Gasparian, G.S., Markosian, A.S.: On a conjecture of Berge. J. Comb. Theory, Ser B56, 97–107 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Meyniel, H.: A new property of critical imperfect graphs and some consequences. Eur. J. Comb.8, 313–316(1987)

    MATH  MathSciNet  Google Scholar 

  12. Olariu, S.: Paw-free graphs. Inf. Proc. Let.28, 53–54 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Padberg, M.W.: Perfect zero-one matrices. Math. Programming6, 180–196 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  14. Parthasarathy, K.R., Ravindra, G.: The strong perfect graph conjecture is true for K1,3-free graphs. J. Comb. Theory, Ser B21, 212–223 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  15. Preissmann, M.: Locally perfect graphs. J. Comb. Theory, Ser B50, 22–40 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  16. Sebö, ?.: Forcing colorations, intervals and the perfect graph conjecture. In R. Kannan E. Balas, G. Cornuéjols, editor, Integer Programming and Combinatorial Optimization II. Carnegie Mellon University Press, Pittsburgh, 1992

    Google Scholar 

  17. Seinsche, S.: On a property of the class of n-colorable graphs. J. Comb. Theory, Ser B16,191–193(1974)

    Article  MATH  MathSciNet  Google Scholar 

  18. Tucker, ?.: The validity of the perfect graph conjecture for K4-free graphs. In C. Berge and V. Chvátal, editors, Topics on perfect graphs, pages 149–157. North-Holland, Amsterdam, 1984

    Chapter  Google Scholar 

  19. Tucker, A.: Coloring perfect (K4-e-free graphs. J. Comb. Theory, Ser B43, 313–318 (1987)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, Laboratoire de Structures Discrètes, BP 53 X, 38041, Grenoble Cédex, France

    Frédéric Maffray

  2. CNRS, Laboratoire Artémis, BP 53 X, 38041, Grenoble Cédex, France

    Myriam Preissmann

Authors
  1. Frédéric Maffray
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myriam Preissmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maffray, F., Preissmann, M. Perfect graphs with noP 5 and noK 5 . Graphs and Combinatorics 10, 179–184 (1994). https://doi.org/10.1007/BF02986662

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02986662

Keywords

Search

Navigation