标题:List edge and list total coloring of 1-planar graphs
作者:Xin ZHANG;Jianliang WU;Guizhen LIU
作者机构:[Zhang, X] School of Mathematics, Shandong University, Jinan 250100, China;[ Wu, J] School of Mathematics, Shandong University, Jinan 250100, China;[ 更多
通讯作者:Liu, G(gzliu@sdu.edu.cn)
通讯作者地址:[Liu, GZ]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:中国数学前沿
出版年:2012
卷:7
期:5
页码:1005-1018
DOI:10.1007/s11464-012-0184-7
关键词:1-planar graph;list coloring conjecture;discharging
摘要: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,it is proved that each 1-planar graph with maximum degree △ is (△ + 1)-edge-choosable and (△ + 2)-total-choosable if △ ≥ 16,and is △-edge-choosable and (△ + 1)-total-choosable if △ ≥ 21.The second conclusion confirms the list coloring conjecture for the class of 1-planar graphs with large maximum degree.
收录类别:CSCD;SCOPUS;SCIE
WOS核心被引频次:9
Scopus被引频次:11
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866120256&doi=10.1007%2fs11464-012-0184-7&partnerID=40&md5=af6dad4c789025e49855eed2ecdc14c3
TOP