Skip to main content
Log in

On Planar Perfectly Contractile Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

An even pair in a graph is a pair of vertices such that every chordless path between them has even length. A graph is called perfectly contractile when every induced subgraph can be transformed into a clique through a sequence of even-pair contractions. In this paper we characterize the planar graphs that are perfectly contractile by determining all the minimal forbidden subgraphs. We give a polynomial algorithm for the recognition of perfectly contractile planar graphs.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bertschi, M.: La colorabilité unique dans les graphes parfaits. PhD thesis, Institut de Mathématiques, Université de Lausanne, Switzerland, 1988

    Google Scholar 

  2. Bertschi, M.E.: Perfectly contractile graphs. J. Comb. Theory Ser. B 50, 222–230 (1990)

    Article  MathSciNet  Google Scholar 

  3. Fonlupt, J., Uhry, J.P.: Transformations which preserve perfectness and h-perfectness of graphs. Ann. of Disc. Maths. 16, 83–85 (1982)

    MATH  MathSciNet  Google Scholar 

  4. Hertz, A., de Werra, D.: Perfectly orderable graphs are quasi-parity graphs: a short proof. Disc. Math. 68, 111–113 (1988)

    Article  MATH  Google Scholar 

  5. Hsu, W.-L.: Coloring planar perfect graphs by decomposition. Combinatorica, 6, 381–385 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hsu, W.L.: Recognizing planar perfect graphs. J. Assoc. Comp. Mach. 34, 255–288 (1987)

    Article  Google Scholar 

  7. Meyniel, H.: A new property of critical imperfect graphs and some consequences. European Journal of Combinatorics 8, 313–316 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Nishizeki, T., Chiba, N.: Planar Graphs: Theory and algorithms, volume 32 of Ann. Disc. Math. North Holland, 1988

  9. Everett, H., Reed, B.A.: Problem session on parity problems. Perfect Graphs Workshop, Princeton University, New Jersey, June 1993

    Google Scholar 

  10. Tucker, A.: The validity of the perfect graph conjecture for K 4-free graphs. In: C. Berge and V. Chvátal: Topics on perfect graphs, pages pp. 149–157. Amsterdam: North Holland 1984

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sales, C.L., Maffray, F. & Reed, B. On Planar Perfectly Contractile Graphs. Graphs and Combinatorics 13, 167–187 (1997). https://doi.org/10.1007/BF03352994

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

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

Key words

Navigation