2000 character limit reached
List edge coloring of outer-1-planar graphs (1902.04359v1)
Published 12 Feb 2019 in math.CO and cs.DM
Abstract: 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 $\chi'_l(G)$ of any outer-1-planar graph $G$ with maximum degree $\Delta(G)\geq 5$ is exactly its maximum degree. In this paper, we prove $\chi'_l(G)=\Delta(G)$ for outer-1-planar graphs $G$ with $\Delta(G)=4$ and with the crossing distance being at least 3.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.