A note on the incidence coloring of outerplanar graphs
classification
🧮 math.CO
keywords
outerplanargraphscolorablecoloringconnecteddeltaeveryfangfang
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.