(1.College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China; 2.School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,Gansu China)
Online:2011-01-25
Published:2012-04-10
About author:CHEN Xiang-en(1965-),male,was born in Tianshui City,Gansu Province,professor,master,research area are coloring theory of graphs and algebra theory of graphs.
Supported by:
National Natural Science Foundation of China (10771091)
[1] BEHZAD M.Graphs and Their Chromatic Numbers [D].Michigan State University,1965.[2] VIZING V G.Some Unsolved Problems in Graph Theory [J].Russian Math. Surveys,1968,23:125-141.[3] HILTON A J W.Recent Results on the Total Chromatic Number [J].Discrete Math.,1993,111:323-331.[4] CHEW K H.Total Chromatic Number of Graphs of High Maximum Degree [J].J.Combin. Math. Combin. Comput,1995,18:245-254.[5] SNCHEZ-ARROYO A.A New Upper Bound for Total Colourings of Graphs [J].Discrete Mathematics,1995,138:375-377.[6] CAMPOS C N,DE MELLO C P.A Result on the Total Colouring of Powers of Cycles [J].Discrete Applied Mathematics,2007,155:585-597.[7] SUN Xiang-yong,WU Jian-liang,WU Yu-wen,et al.Total Colorings of Planar Graphs Without Adjacent Triangles [J].Discrete Mathematics,2009,309:202-206.[8] NICOLAS R,ZHU Xu-ding.Total Coloring of Planar Graphs of Maximum Degree Eight [J].Information Processing Letters,2010,110:321-324.
