Lars Jaffke, A complexity dichotomy for critical values of the b-chromatic number of graphs
A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the …
1 event found.