A note on the minimum total coloring of planar graphs
暂无分享,去创建一个
Bin Liu | Hongwei Gao | B. Liu | Hui Juan Wang | Zhao Yang Luo | Yan Gu | Hui Juan Wang | Yan Gu | Zhaohua Luo | Hongwei Gao
[1] Yue Zhao,et al. On total 9-coloring planar graphs of maximum degree seven , 1999 .
[2] Alexandr V. Kostochka,et al. The total chromatic number of any multigraph with maximum degree five is at most seven , 1996, Discret. Math..
[3] H. Yap. Total Colourings of Graphs , 1996 .
[4] Panos M. Pardalos,et al. Minimum total coloring of planar graph , 2014, J. Glob. Optim..
[5] V. G. Vizing. SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .
[6] V. A. Bojarshinov. Edge and total coloring of interval graphs , 2001, Discret. Appl. Math..
[7] Abddn SANCHEZ-ARROYO,et al. Determining the total colouring number is np-hard , 1989, Discret. Math..
[8] Jian-Liang Wu,et al. Total Coloring of Planar Graphs Without Some Chordal 6-cycles , 2015 .
[9] Jian-Liang Wu,et al. Total Coloring of Series-Parallel Graphs , 2004, Ars Comb..
[10] Bin Liu,et al. Total Coloring of Planar Graphs Without Chordal Short Cycles , 2015, Graphs Comb..
[11] Jian Chang,et al. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords , 2013, Theor. Comput. Sci..
[12] Weili Wu,et al. Total coloring of planar graphs without adjacent chordal 6-cycles , 2017, J. Comb. Optim..
[13] Colin McDiarmid,et al. Total colouring regular bipartite graphs is NP-hard , 1994, Discret. Math..
[14] Yingqian Wang,et al. Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable , 2009, Discret. Appl. Math..
[15] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[16] Jean-Sébastien Sereni,et al. Total colouring of plane graphs with maximum degree nine , 2007 .