The edge chromatic number of outer-1-planar graphs
arXiv:1405.3183
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. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs.