From semi-total to equitable total colorings, and their induced partitions into perfect and total perfect codes

I. J. Dejter

Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a connected simple graph $G$ is either $\Delta (G)+1$ or $\Delta (G)+2$, wher…