Abstract A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has a neighbor in each ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback