Total coloring of three types of planar graphs with maximum degree six and without intersecting 4-cycles
Lan Xu · Journal of Shandong University · 2010
Let G be a planar graph with (G)≥6 and without intersecting 4-cycles.It is proved that the total chromatic number is χ″(G)=(G)+1 if G without intersecting 3-cycles,or without 5-cycles,or without 6-cycles.