Bounds for the $b$-chromatic number of some families of graphs

Details Bounds for the $b$-chromatic number of some families of graphs Bounds for the $b$-chromatic number of some families of graphs

2005-06-09

arxiv.org/abs/math/0506167v1

Mathematics

Combinatorics

10 pages

Scientific paper

In this paper we obtain some upper bounds for $b$-chromatic number of
$K_{1,t}$ -free graphs, graphs with given minimum clique partition and
bipartite graphs. These bounds are in terms of either clique number or
chromatic number of graphs or biclique number for bipartite graphs. We show
that all the bounds are tight.

Affiliated with

Also associated with

No associations

Rating

Bounds for the $b$-chromatic number of some families of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds for the $b$-chromatic number of some families of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for the $b$-chromatic number of some families of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170629