Emergent Mind
List edge coloring of outer-1-planar graphs
(1902.04359)
Published Feb 12, 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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.