The semi-chromatic number of a graph
V. G. Vizing · Journal of Applied and Industrial Mathematics · 2013
We introduce the notion of the semi-chromatic number of a graph with a nonempty number of edges. Then we prove that the difference between the semi-chromatic number and the half of the chromatic number is at most 1.