标题:A Totally(Δ+1)-colorable 1-planar Graph with Girth at Least Five
作者:Lin SUN;Jian Liang WU;Hua CAI;
作者机构:[Sun, L] School of Mathematics, Shandong University, Ji’nan, 250100, China, Department of Mathematics, Changji University, Changji, 831100, China;[ W 更多
通讯作者:Wu, JL(jlwu@sdu.edu.cn)
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:Acta Mathematica Sinica
出版年:2016
卷:32
期:11
页码:1337-1349
DOI:10.1007/s10114-016-5480-9
关键词:1-planar graph;total coloring;discharging method;girth
摘要: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 prove that every 1-planar graph G with maximum degree Δ(G)≥12 and girth at least five is totally(Δ(G)+1)-colorable.
收录类别:CSCD;SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991515325&doi=10.1007%2fs10114-016-5480-9&partnerID=40&md5=f634b3d5ae4c82b326c4c07a48a04b42
TOP