Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic

• 作 者: WANG HuiJuan LIU Bin WU JianLi
• 机 构: SchoolofMathematics,DepartmentofMathematics,DepartmentofMathematics
• 出 处: 中国科学：数学英文版
• 发表日期: 2014年1期
• 关键词: total coloring Euler characteristic surface total coloring Euler characteristic
• 基金项目: supported by National Natural Science Foundation of China （Grant Nos. 11201440,11271006 and 11271341）, Graduate Independent Innovation Foundation of Shandong University （Grant No. yzc12100）

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 △（G）＋1 if △（G）9,where △（G）is the maximum degree of G.