A note on the incidence coloring of outerplanar graphs
Combinatorics
2008-06-19 v2
Abstract
A proof that every outerplanar graph is \Delta+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.
Cite
@article{arxiv.0707.2576,
title = {A note on the incidence coloring of outerplanar graphs},
author = {Maksim Maydanskiy},
journal= {arXiv preprint arXiv:0707.2576},
year = {2008}
}
Comments
added reference to bounds for planar and higher genus graphs