A note on the incidence coloring of outerplanar graphs
Maksim Maydanskiy · arXiv (Cornell University) · 2007
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.