List Edge Coloring of Outer-1-planar Graphs  

作　　者：Xin ZHANG 

机构地区：[1]School of Mathematics and Statistics,Xidian University,Xi'an 710071,China

出　　处：《Acta Mathematicae Applicatae Sinica》2020年第3期737-752,共16页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (Nos. 11871055,11301410);the Youth Talent Support Plan of Xi’an Association for Science and Technology,China (2018-6)

摘　　要：A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.It is known that the list edge chromatic numberχ′l(G)of any outer-1-planar graph G with maximum degreeΔ(G)≥5 is exactly its maximum degree.In this paper,we proveχ′l(G)=Δ(G)for outer-1-planar graphs G withΔ(G)=4 and with the crossing distance being at least 3.

关 键 词：outerplanar graph outer-1-planar graph crossing distance list edge coloring 

分 类 号：O157.5[理学—数学]