2019/02/12 by Xin Zhang, Zhang, Xin
Computer Science · #05C10 #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.1902.04359
openalex publication_date 2019/02/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.