Bounds for the b-chromatic number of powers of hypercubes

P. Francis, S. Francis Raj, M. Gokulnath

The b-chromatic number $b(G)$ of a graph $G$ is the maximum $k$ for which $G$ has a proper vertex coloring using $k$ colors such that each color class contains at least one vertex…