The edge chromatic number of outer-1-planar graphs
Xin Zhang
TL;DR
This paper fully characterizes the edge chromatic number of outer-1-planar graphs, a class of graphs drawable with vertices on the outer face and at most one crossing per edge.
Contribution
It provides a complete determination of the edge chromatic number specifically for outer-1-planar graphs, advancing understanding of their coloring properties.
Findings
Exact edge chromatic number for outer-1-planar graphs established
Characterization of coloring constraints in outer-1-planar graphs
Theoretical framework for edge coloring in this graph class
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems