Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 2001: Graph-Theoretic Concepts in Computer Science pp 317–327Cite as

Critical and Anticritical Edges in Perfect Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2204))

Abstract

We call an edge e of a perfect graph G critical if G - e is imperfect and sayfurther that e is anticritical with respect to the complementary graph \( \overline G \) . We ask in which perfect graphs critical and anticritical edges occur and how to find critical and anticritical edges in perfect graphs. Finally, we study whether we can order the edges of certain perfect graphs such that deleting all the edges yields a sequence of perfect graphs ending up with a stable set.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berge, C.: Färbungen von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind. Wiss. Zeitschrift der Martin-Luther-Universität Halle-Wittenberg (1961) 114–115

    Google Scholar 

  2. Berge, C., Duchet, P.: Strongly Perfect Graphs. In: Berge, C., Chvátal, V. (eds.): Topics on Perfect Graphs. North Holland, Amsterdam (1984) 57–61

    Chapter  Google Scholar 

  3. Chvátal, V.: Star-Cutsets and Perfect Graphs. J. Combin. Theory(B) 39 (1985) 189–199

    Article  MATH  Google Scholar 

  4. Chvátal, V., Sbihi, N.: Bull-Free Berge Graphs are Perfect. Graphs and Combinatorics 3 (1987) 127–139

    Article  MATH  MathSciNet  Google Scholar 

  5. Grötschel, M., Lovász, L., Schrijver, A.: The Ellipsoid Method and its Consequences in Combinatorial Optimization. Combinatorica 1 (1981) 169–197

    Article  MATH  MathSciNet  Google Scholar 

  6. Hayward, R.B.: Weakly Triangulated Graphs. J. Combin. Theory(B) 39 (1985) 200–209

    Article  MATH  MathSciNet  Google Scholar 

  7. Hayward, R.B.: Generating Weakly Triangulated Graphs. J. Graph Theory 21, No. 1 (1996) 67–69

    Google Scholar 

  8. Hayward, R.B., Hoàng, C.T., Maffray, F.: Optimizing Weakly Triangulated Graphs. Graphs and Combinatorics 5 (1989) 339–349, erratum in 6 (1990) 33–35

    Google Scholar 

  9. Hertz, A.: Slim Graphs. Graphs and Combinatorics 5 (1989) 149–157

    Article  MATH  MathSciNet  Google Scholar 

  10. Hoàng, C.T.: Some Properties of Minimal Imperfect Graphs. Discrete Math. 160 (1996) 165–175

    Article  MATH  MathSciNet  Google Scholar 

  11. Lovász, L.: Normal Hypergraphs and the Weak Perfect Graph Conjecture. Discrete Math. 2 (1972) 253–267

    Article  MATH  MathSciNet  Google Scholar 

  12. Meyniel, H.: On The Perfect Graph Conjecture. Discrete Math. 16 (1976) 339–342

    Article  MathSciNet  Google Scholar 

  13. Meyniel, H.: A New Property of Critical Imperfect Graphs and some Consequences. Europ. J. Combinatorics 8 (1987) 313–316

    MATH  MathSciNet  Google Scholar 

  14. Olariu, S.: No Antitwins in Minimal Imperfect Graphs. J. Combin. Theory(B) 45 (1988) 255–257

    Article  MATH  MathSciNet  Google Scholar 

  15. Padberg, M.W.: Perfect Zero-One Matrices. Math. Programming 6 (1974) 180–196

    Article  MATH  MathSciNet  Google Scholar 

  16. Parthasarathy, K.R., Ravindra, G.: The Strong Perfect Graph Conjecture is True for K1,3-free Graphs. J. Combin. Theory(B) 21 (1976) 212–223

    Article  MATH  MathSciNet  Google Scholar 

  17. Spinrad, J., Sritharan, R.: Algorithms for WeaklyT riangulated Graphs. Discrete Appl. Math. 59 (1995) 181–191

    Article  MATH  MathSciNet  Google Scholar 

  18. Tucker, A.: Critical Perfect Graphs and Perfect 3-chromatic Graphs. J. Combin. Theory(B) 23 (1977) 143–149

    Article  MATH  Google Scholar 

  19. Tucker, A.: Coloring Perfect (K4-e)-free Graphs. J. Combin. Theory(B) 42 (1987) 313–318

    Article  MATH  Google Scholar 

  20. Wagler, A.: Critical Edges in Perfect Graphs. PhD thesis, TU Berlin (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, 14195, Berlin, Germany

    Annegret Wagler

Authors
  1. Annegret Wagler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagler, A. (2001). Critical and Anticritical Edges in Perfect Graphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation