Problem 4.9: Total Coloring
The announced English version of the proof of the total
coloring conjecture in the case of multigraphs with
Δ ≤ 5 has been
published in
A.V. Kostochka, The total chromatic number of any multigraph with
maximum degree five is at most seven, Discrete Mathematics
162 (1996) 199-214.
Tommy R. Jensen, December 8, 1999.
Last modified December 8, 1999
Tommy R. Jensen