arXiv Analytics

Sign in

arXiv:0707.2576 [math.CO]AbstractReferencesReviewsResources

A note on the incidence coloring of outerplanar graphs

Maksim Maydanskiy

Published 2007-07-17, updated 2008-06-19Version 2

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.

Comments: added reference to bounds for planar and higher genus graphs
Categories: math.CO
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:1505.04908 [math.CO] (Published 2015-05-19)
On incidence coloring of Cartesian products of graphs
arXiv:2408.09081 [math.CO] (Published 2024-08-17)
B-colorings of planar and outerplanar graphs
arXiv:2411.04601 [math.CO] (Published 2024-11-07)
Matching Complexes of Outerplanar Graphs

Links

Toolbox