(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 @D at least 6 and without adjacent short cycles is (@D+1)-totally-colorable.

[1]  Ping Wang,et al.  A note on total colorings of planar graphs without 4-cycles , 2004, Discuss. Math. Graph Theory.

[2]  Yingqian Wang,et al.  On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles , 2009, Graphs Comb..

[3]  Ko-Wei Lih,et al.  On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles , 2009, Appl. Math. Lett..

[4]  Jianfeng Hou,et al.  List edge and list total colorings of planar graphs without 4-cycles , 2006, Theor. Comput. Sci..

[5]  Yue Zhao,et al.  On total 9-coloring planar graphs of maximum degree seven , 1999 .

[6]  Wei-Fan Wang,et al.  Total chromatic number of planar graphs with maximum degree ten , 2007, J. Graph Theory.

[7]  Bin Liu,et al.  Total colorings and list total colorings of planar graphs without intersecting 4-cycles , 2009, Discret. Math..

[8]  Yingqian Wang,et al.  Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable , 2010, Discret. Math..

[9]  Yingqian Wang,et al.  Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable , 2009, Discret. Appl. Math..

[10]  N. Vijayaditya.  On Total Chromatic Number of a Graph , 1971 .

[11]  Jean-Sébastien Sereni,et al.  Total colouring of plane graphs with maximum degree nine , 2007 .

[12]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[13]  V. G. Vizing.  SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .

[14]  Xuding Zhu,et al.  Total coloring of planar graphs of maximum degree eight , 2010, Inf. Process. Lett..

[15]  Yue Zhao,et al.  On total 9-coloring planar graphs of maximum degree seven , 1999, J. Graph Theory.

[16]  Alexandr V. Kostochka,et al.  List Edge and List Total Colourings of Multigraphs , 1997, J. Comb. Theory B.

[17]  Oleg V. Borodin,et al.  On the total coloring of planar graphs. , 1989 .

[18]  Alexandr V. Kostochka,et al.  The total coloring of a multigraph with maximal degree 4 , 1977, Discret. Math..

[19]  Alexandr V. Kostochka,et al.  The total chromatic number of any multigraph with maximum degree five is at most seven , 1996, Discret. Math..

[20]  Yingqian Wang,et al.  Total colorings of planar graphs with maximum degree at least 8 , 2009 .

[21]  Alexandr V. Kostochka,et al.  Total Colourings of Planar Graphs with Large Girth , 1998, Eur. J. Comb..

[22]  H. Yap.  Total Colourings of Graphs , 1996 .

[23]  M. Rosenfeld,et al.  On the total coloring of certain graphs , 1971 .

[24]  Alexandr V. Kostochka,et al.  Total colorings of planar graphs with large maximum degree , 1997, J. Graph Theory.

[25]  Jianfeng Hou,et al.  Total Colorings of Planar Graphs without Small Cycles , 2008, Graphs Comb..