2014/05/13 by Xin Zhang, Zhang, Xin
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1405.3183
openalex publication_date 2014/05/13 · arxiv created 2014/05/14 · arxiv updated 2014/05/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.