A note on the total coloring of planar graphs without adjacent 4-cycles

Let GG be a planar graph with maximum degree Δ≥7Δ≥7 and without adjacent 4-cycles, that is, two cycles of length 4 do not share one common edge. Then its total chromatic number is Δ+1Δ+1.