标题:Total Coloring of Planar Graphs without Chordal 7-cycles
作者:Hua CAI
作者机构:[Cai Hua] School of Mathematics, Shandong University, Ji'nan, Shandong 250100, China.
通讯作者:Cai, H(lyreapple@163.com)
通讯作者地址:[Cai, H]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:数学学报(英文版)
出版年:2015
卷:31
期:12
页码:1951-1962
DOI:10.1007/s10114-015-4337-y
关键词:Planar graph;total coloring;chordal 7-cycle
摘要:A k-total-coloring of a graph G is a coloring of vertices and edges of G using k colors such that no two adjacent or incident elements receive the same color. In this paper, it is proved that if G is a planar graph with Delta(G) >= 7 and without chordal 7-cycles, then G has a (Delta(G) + 1)-total-coloring. Keywords Planar graph, total coloring, chordal 7-cycle
收录类别:CSCD;SCOPUS;SCIE
资源类型:期刊论文
原文链接:http://lib.cqvip.com/qk/85800X/201512/666585697.html
TOP