Total Coloring of Planar Graphs without Adjacent 4-cycles

摘要：

Let G be a planar graph with maximum degree△. Its proved that if △≥8 and G does not contain adjacent 4-cycles, then the total chromatic number x (G)=△+ 1.

关键词： planar graph total coloring adjacent cycle

作者: Xiang Tan Hong-Yu Chen Jian-Liang Wu

作者单位: School of Mathematics, Shandong University,Jinan, Shandong, 250100, China School of Statistics and M School of Mathematics, Shandong University, Jinan, Shandong, 250100, China

会议类型: 国际会议

会议名称: The 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 167-173

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）