Theb-chromatic number of certain graphs and digraphs
Johan Kok, Sudev Naduvath · Journal of Discrete Mathematical Sciences and Cryptography · 2016
The b-chromatic number of a graph G is the maximum number k of colours in a proper colouring of G, such that at least one vertex in each colour class has a neighbour in all other classes. In this paper, we discuss the b-chromatic number of certain classes of graphs and digraphs.