标题：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 更多[Sun, L] School of Mathematics, Shandong University, Ji’nan, 250100, China, Department of Mathematics, Changji University, Changji, 831100, China;[ Wu, J.L] School of Mathematics, Shandong University, Ji’nan, 250100, China;[ Cai, H] Department of Mathematics, Changji University, Changji, 831100, China 收起
通讯作者：Wu, JL(jlwu@sdu.edu.cn)
通讯作者地址：[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
摘要：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.
