Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles

Abstract

The Total Coloring Conjecture (TCC) is a challenging unsolved problem posed by Behzad and Vizing independently, which states that every simple graph $G$ admits a ($\Delta (G)$ +2)-total-coloring, where $\Delta (G)$ denotes the maximum degree of $G$. This conjecture has been confirmed for graphs with $\Delta (G)\le 5$. However, for planar graphs, the only open case is $\Delta (G)=6$. It was known that planar graphs with maximum degree 6 and without 4-cycles are 7-totally-colorable. In this paper, we improve this result by showing that any planar graph $G$ of maximum degree 6, which does not contain some special 4-cycles, is 7-totally-colorable.

arXiv comment9 pages, 7 figures