On total chromatic number of planar graphs without 4-cycles

Let G be a simple graph with maximum degree A(G) and total chromatic number chi(ve) (G). Vizing conjectured that Delta(G) + 1 <= chi(ve) (G) <= Delta(G) + 2 (Total Chromatic Conjecture). Even for planar graphs, this conjecture has not been settled yet. The unsettled difficult case for planar graphs is Delta(G) = 6. This paper shows that if G is a simple planar graph with maximum degree 6 and without 4-cycles, then chi v(e) (G) <= 8. Together with the previous results on this topic, this shows that every simple planar graph without 4-cycles satisfies the Total Chromatic Conjecture.