Skip to main content
SpringerLink
Log in

Circular-Perfect Concave-Round Graphs

  • Conference paper
Book cover Graph-Theoretic Concepts in Computer Science (WG 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4271))

Included in the following conference series:

Abstract

For 1≤d≤k–d, K k/d denotes the graph with vertices 0,1,...,k–1, in which i is adjacent to j if and only if d≤|i–j|≤k–d. A graph G is circular-perfect if, for every induced subgraph H of G, the infinum k/d for which H admits a homomorphism to K k/d is equal to the supremum k/d for which K k/d admits a homomorphism to H. We answer a question af Bang-Jensen and Huang by giving a complete characterization of circular-perfect concave-round graphs.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bang-Jensen, J., Huang, J.: Convex-round graphs are circular-perfect. J. Graph Theory 40(3), 182–194 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Bondy, J.A., Hell, P.: A note on the star chromatic number. Journal of Graph Theory 14, 479–482 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The Strong Perfect Graph Theorem. In: Annals of Mathematics (to appear)

    Google Scholar 

  5. Coulonges, S., Pêcher, A., Wagler, A.: Triangle-free strongly circular-perfect graphs. Discrete Mathematics (Submitted)

    Google Scholar 

  6. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  7. Gyárfás, A.: Problems from the world surrounding perfect graphs. Zastos. Mat. 19, 413–431 (1987)

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Reed, B., Ramirez-Alfonsin, J.: Perfect Graphs. Wiley, Chichester (2001)

    MATH  Google Scholar 

  10. Shepherd, F.B.: Applying Lehman’s Theorem to Packing Problems. Math. Programming 71, 353–367 (1995)

    MathSciNet  MATH  Google Scholar 

  11. Trotter Jr., L.E.: A Class of Facet Producing Graphs for Vertex Packing Polyhedra. Discrete Math. 12, 373–388 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  12. Vince, A.: Star chromatic number. Journal of Graph Theory 12, 551–559 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Wagler, A.: Antiwebs are rank-perfect. Quarterly Journal of the Belgian, French and Italian OR Societies 2, 149–152 (2004)

    MATH  MathSciNet  Google Scholar 

  14. Zhu, X.: circular-perfect Graphs. J. of Graph Th. 48, 186–209 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Bordelais de Recherche Informatique (LaBRI) Talence, France

    Sylvain Coulonges

Authors
  1. Sylvain Coulonges
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Fedor V. Fomin

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coulonges, S. (2006). Circular-Perfect Concave-Round Graphs. In: Fomin, F.V. (eds) Graph-Theoretic Concepts in Computer Science. WG 2006. Lecture Notes in Computer Science, vol 4271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11917496_31

Download citation

  • DOI: https://doi.org/10.1007/11917496_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48381-6

  • Online ISBN: 978-3-540-48382-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation