A note on the incidence coloring of outerplanar graphs
Maksim Maydanskiy
TL;DR
This paper proves that all outerplanar graphs can be colored with at most +2 colors, slightly strengthening previous results that focused on 2-connected outerplanar graphs.
Contribution
It extends the known coloring bounds to all outerplanar graphs, not just 2-connected ones, providing a broader theoretical result.
Findings
Outerplanar graphs are +2 colorable
The result improves upon previous work limited to 2-connected graphs
The proof is a new contribution to graph coloring theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems