2007/07/17 by Maksim Maydanskiy, Maydanskiy, Maksim
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #math.CO #msc:05C15
paper · pdf · doi:10.48550/arxiv.0707.2576
added reference to bounds for planar and higher genus graphs
openalex publication_date 2007/07/17 · arxiv created 2008/06/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A proof that every outerplanar graph is Δ+2 colorable. This is slightly stronger then an unpublished result of Wang Shudong, Ma Fangfang, Xu Jin, and Yan Lijun proving the same for 2-connected outerplanar graphs.