(Delta+1)-total-colorability of plane graphs with maximum degree Delta 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 Delta at least 6 and without adjacent short cycles is (Delta + 1)-totally-colorable. (C) 2010 Elsevier B.V. All rights reserved.
plane graph maximum degree combinatorial problems total coloring