journal6 ›› 2011, Vol. 32 ›› Issue (1): 1-3.

• Mathematics •     Next Articles

Various General Total Colorings of Graphs


  1. (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)

Abstract: A proper total coloring of a graph G is an assignment of colors to the edges and vertices of G in such a way that no two adjacent vertices,no two adjacent edges,and no incident vertex and edge receive the same color.In this paper,the authors weaken the constraints of the proper total coloring to obtain several general total colorings and  discuss their chromatic numbers.

Key words: total coloring, chromatic number, edge chromatic index

WeChat e-book chaoxing Mobile QQ