The edge chromatic number of outer-1-planar graphs
Combinatorics
2014-05-15 v2 Discrete Mathematics
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.
Cite
@article{arxiv.1405.3183,
title = {The edge chromatic number of outer-1-planar graphs},
author = {Xin Zhang},
journal= {arXiv preprint arXiv:1405.3183},
year = {2014}
}