A note on the incidence coloring of outerplanar graphs

Simple item page
dc.creatorMaydanskiy, Maksim
dc.date2007-07-17
dc.date2008-06-19
dc.date.accessioned2026-07-07T09:45:09Z
dc.date.available2026-07-07T09:45:09Z
dc.descriptionA 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.
dc.descriptionadded reference to bounds for planar and higher genus graphs
dc.identifierhttps://arxiv.org/abs/0707.2576
dc.identifierhttp://arxiv.org/abs/0707.2576
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163107
dc.subjectCombinatorics
dc.subject05C15
dc.titleA note on the incidence coloring of outerplanar graphs
dc.typetext

Files

Collections

arXiv