| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646881 | Discrete Mathematics | 2016 | 7 Pages |
Abstract
A graph is outer-1-planar if each block has an embedding in the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Xin Zhang,