(Δ+1)-total-colorability of plane graphs with maximum degree Δ at least 6 and without adjacent short cycles

By a short cycle we mean a cycle of length at most 4. In this paper, we prove that every plane graph with maximum degree Δ at least 6 and without adjacent short cycles is (Δ+1)-totally-colorable.