Skip to main content
SpringerLink
Log in

On b-perfect Chordal Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.

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. Berge, C.: Graphs. North Holland (1985)

  2. Faik, T.: La b-continuité des b-colorations: complexité, propriétés structurelles et algorithmes. PhD thesis, Univ. Orsay, France (2005)

  3. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs., Annals of Discrete Mathematics 57, 2nd Edition, North Holland (2004)

  4. Hoàng, C.T., Kouider, M.: On the b-dominating coloring of graphs. Discrete Applied Mathematics 152, 176–186 (2005)

    Google Scholar 

  5. Hoàng, C.T., Linhares Sales, C., Maffray, F.: On minimally b-imperfect graphs. To appear in Discrete Applied Mathematics

  6. Irving, R.W., Manlove, D.F.: The b-chromatic number of graphs. Discrete Applied Mathematics 91, 127–141 (1999)

    Google Scholar 

  7. Kouider, M., Mahéo, M.: Some bounds for the b-chromatic number of a graph. Discrete Mathematics 256, 267–277 (2002)

    Google Scholar 

  8. Kouider, M., Zaker, M.: Bounds for the b-chromatic number of some families of graphs. Discrete Mathematics 306, 617–623 (2006)

    Google Scholar 

  9. Kratochvíl, J., Tuza, Zs., Voigt, M.: On the b-chromatic number of graphs. Lecture Notes in Computer Science 2573, Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002, p. 310–320

  10. Ramírez-Alfonsín, J., Reed, B.: Perfect Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley (2001)

Download references

Author information

Authors and Affiliations

  1. CNRS, Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031, Grenoble Cedex, France

    Frédéric Maffray

  2. USTHB, Laboratoire LAID3, BP32 El Alia, Bab Ezzouar, 16111, Alger, Algeria

    Meriem Mechebbek

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

    You can also search for this author in PubMed Google Scholar

  2. Meriem Mechebbek
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by Algerian-French program CMEP/Tassili 05 MDU 639.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maffray, F., Mechebbek, M. On b-perfect Chordal Graphs. Graphs and Combinatorics 25, 365–375 (2009). https://doi.org/10.1007/s00373-009-0845-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-009-0845-9

Keywords

Search

Navigation