Bounds for the b-chromatic number of some families of graphs |
| |
| Authors: | Mekkia Kouider |
| |
| Institution: | a L.R.I, Unite Mixte de Recherche 8623, Université Paris-Sud, Orsay, France
b Institute for Advanced Studies in Basic Sciences, Zanjan, Iran |
| |
| Abstract: | In this paper we obtain some upper bounds for the b-chromatic number of K1,s-free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are given in terms of either the clique number or the chromatic number of a graph or the biclique number for a bipartite graph. We show that all the bounds are tight. |
| |
| Keywords: | b-Chromatic number b-Coloring Chromatic number t-Dominating coloring |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
