total coloring;
Euler characteristic;
surface;
TOTAL CHROMATIC NUMBER;
PLANAR GRAPHS;
4-CYCLES;
D O I:
10.1007/s11425-013-4576-2
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Let G be a graph which can be embedded in a surface of nonnegative Euler characteristic. In this paper, it is proved that the total chromatic number of G is Delta(G) + 1 if Delta(G) >= 9, where Delta(G) is the maximum degree of G.