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 …