The edge chromatic number of outer-1-planar graphs
classification
🧮 math.CO
cs.DM
keywords
edgechromaticgraphsnumberouterouter-1-planarcompletelycrossed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.