Abstract
A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex that has neighbors in all other classes. The b-chromatic number of is the largest integer such that has a b-coloring with colors. Javadi and Omoomi ("On b-coloring of cartesian product of graphs", Ars Combinatoria 107 (2012) 521-536) proved that the b-chromatic number of (the Cartesian product of two complete graphs on vertices) is in the set and conjectured that the exact value is for all . We give counterexamples to this conjecture for , and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.