1 paper · 1 filter
Frédéric Maffray, Meriem Mechebbek
The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a…