Elsevier

Discrete Mathematics

Volume 162, Issues 1–3, 25 December 1996, Pages 199-214
Discrete Mathematics

Regular paper
The total chromatic number of any multigraph with maximum degree five is at most seven☆

https://doi.org/10.1016/0012-365X(95)00286-6Get rights and content
Under an Elsevier user license
open archive

Abstract

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.

Cited by (0)

☆

This work was also partly supported by Grant 93-01-01486 of the Russian Foundation of Fundamental Research.

∗

This research described in this publication was made possible in part by Grant N RPY000 from the International Science Foundation.

Copyright © 1996 Published by Elsevier B.V.