A note on the incidence coloring of outerplanar graphs
arXiv:0707.2576
Abstract
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.
added reference to bounds for planar and higher genus graphs