标题:On Total Colorings of Some Special 1-planar Graphs
作者:Lin SUN;Jian-liang WU;Hua CAI;
作者机构:[Lin SUN;Jian-liang WU;Hua CAI]Department of Mathematics, Changji University;[Lin SUN;Jian-liang WU;Hua CAI]School of Mathematics, Shandong University
来源:Acta Mathematicae Applicatae Sinica
出版年:2017
期:03
页码:607-618
关键词:1-planar graph;total coloring;discharging method;girth;r-minimal graph
摘要:A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we verify the total coloring conjecture for every 1-planar graph G if either ?(G) ≥ 9 and g(G) ≥ 4, or ?(G) ≥ 7 and g(G) ≥ 5, where ?(G) is the maximum degree of G and g(G) is t...
资源类型:期刊论文
原文链接:http://kns.cnki.net/kns/detail/detail.aspx?FileName=YISY201703005&DbName=CJFQ2017
TOP