A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable

It is known that Total Coloring Conjecture (TCC) was verified for planar graphs with maximum degree Δ≠6. In this paper, we prove that TCC holds for planar graphs G with Δ(G)=6, if G does not contain any subgraph isomorphic to a 4-fan.