标题:On total colorings of 1-planar graphs
作者:Zhang, Xin;Hou, Jianfeng;Liu, Guizhen
作者机构:[Zhang, X] Department of Mathematics, Xidian University, Xi’an, 710071, China;[ Hou, J] Center for Discrete Mathematics, Fuzhou University, Fuzhou, 3 更多
通讯作者:Zhang, Xin
通讯作者地址:[Zhang, X]Xidian Univ, Dept Math, Xian 710071, Peoples R China.
来源:Journal of combinatorial optimization
出版年:2015
卷:30
期:1
页码:160-173
DOI:10.1007/s10878-013-9641-9
关键词:1-Planar graph;Total coloring;Discharging method
摘要:A graph is -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 confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
收录类别:EI;SCOPUS;SCIE
WOS核心被引频次:2
Scopus被引频次:5
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938216908&doi=10.1007%2fs10878-013-9641-9&partnerID=40&md5=13c782ab993ad4b2a9f9728a8a31c9b9
TOP