Title of article
Bounds for the b-chromatic number of some families of graphs Original Research Article
Author/Authors
Mekkia Kouider، نويسنده , , Manouchehr Zaker، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
7
From page
617
To page
623
Abstract
In this paper we obtain some upper bounds for the b-chromatic number of K1,sK1,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-coloring , t-Dominating coloring , b-chromatic number , Chromatic number
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948219
Link To Document