Journal of Combinatorial Optimization

, Volume 33, Issue 1, pp 202–214 | Cite as

On the b-coloring of tight graphs

Article

Abstract

A coloring c of a graph \(G=(V,E)\) is a b -coloring if for every color i there is a vertex, say w(i), of color i whose neighborhood intersects every other color class. The vertex w(i) is called a b-dominating vertex of color i. The b -chromatic number of a graph G, denoted by b(G), is the largest integer k such that G admits a b-coloring with k colors. Let m(G) be the largest integer m such that G has at least m vertices of degree at least \(m-1\). A graph G is tight if it has exactly m(G) vertices of degree \(m(G)-1\), and any other vertex has degree at most \(m(G)-2\). In this paper, we show that the b-chromatic number of tight graphs with girth at least 8 is at least \(m(G)-1\) and characterize the graphs G such that \(b(G)=m(G)\). Lin and Chang (2013) conjectured that the b-chromatic number of any graph in \(\mathcal {B}_{m}\) is m or \(m-1\) where \(\mathcal {B}_{m}\) is the class of tight bipartite graphs \((D,D{^\prime })\) of girth 6 such that D is the set of vertices of degree \(m-1\). We verify the conjecture of Lin and Chang for some subclass of \(\mathcal {B}_{m}\), and we give a lower bound for any graph in \(\mathcal {B}_{m}\).

Keywords

Coloring b-coloring b-chromatic number Tight graphs 

Mathematics Subject Classification

05C15 

References

  1. Balakrishnan R, Francis Raj S (2009) Bounds for the \(b\)-chromatic number of vertex-deleted subgraphs and the extremal graphs. Electron Notes Discret Math 34(1):353–358Google Scholar
  2. Blidia M, Ikhlef Eschouf N, Maffray F (2013) On vertex \(b\)-critical trees. Opusc Math 33(1):19–28MathSciNetCrossRefMATHGoogle Scholar
  3. Bonomo F, Duran G, Maffray F, Marenco J, Valencia-Pabon M (2009) On the b-coloring of cographs and \(P_{4}\)-sparse graphs. Graph Comb 25:1–15CrossRefMATHGoogle Scholar
  4. Campos V, Farias V, Silva A (2012) b-coloring with large girth. arXiv:1202.4032
  5. Campos V, Lima C, Silva A (2013) b-coloring with large girth at least 8. In: The 7th European conference on combinatorics, graph theory and applicationsGoogle Scholar
  6. El Sahili A, Kouider M, Mortada M (2013) On the \(b\)-chromatic number of regular bounded graphs. arXiv:1302.4209
  7. Faik T (2005) La \(b\)-colorations: complexité, propriétés structurelles et algorithmes. Thèse de Doctorat, Université Paris XI OrsayGoogle Scholar
  8. Ikhlef Eschouf N (2010) Characterization of some \(b\)-chromatic edge critical graphs. Australas J Comb 47:21–35MathSciNetMATHGoogle Scholar
  9. Irving RW, Manlove DF (1999) The \(b\)-chromatic number of graphs. Discret Appl Math 91:127–141CrossRefMATHGoogle Scholar
  10. Kouider M (2013) On quasi-monotonous graphs. HAL no 00801393Google Scholar
  11. Lin W-H, Changa GJ (2013) b-coloring of tight bipartite graphs and the Erds-FaberLovsz conjecture. Discret Appl Math 161:1060–1066CrossRefGoogle Scholar
  12. Silva A (2010) The b-chromatic number of some tree-like graphs. PhD Thesis, Université de GrenobleGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Laboratoire de Recherche en Informatique (LRI)Université Paris-SudOrsayFrance
  2. 2.Faculté des sciences et de la TechnologieUniversité de MédéaMedeaAlgeria

Personalised recommendations