论文信息 - Total colorings of planar graphs with maximum degree at least 8 - 字舞流文

Total colorings of planar graphs with maximum degree at least 8

Planar graphs with maximum degree Δ ⩾ 8 and without 5- or 6-cycles with chords are proved to be (δ + 1)-totally-colorable.

Yingqian Wang | Lan Shen

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

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

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

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

[5] Alexandr V. Kostochka,et al. Total colorings of planar graphs with large maximum degree , 1997 .

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

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

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

[9] Yingqian Wang,et al. On total chromatic number of planar graphs without 4-cycles , 2007 .

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

[11] Weifan Wang. Total chromatic number of planar graphs with maximum degree ten , 2007 .

[12] R. I. Kachurovskii. Non-Linear Monotone Operators in Banach Spaces , 1968 .