On the additive chromatic number of several families of graphs
Daniel Severin

TL;DR
This paper investigates the additive chromatic number of various graph families, confirming a conjecture for split graphs and providing exact formulas for several specific subclasses, advancing understanding of this graph coloring variation.
Contribution
It proves the additive chromatic number conjecture for split graphs and derives exact formulas for multiple graph subclasses, expanding the known cases.
Findings
Conjecture holds for split graphs.
Exact formulas for specific graph families.
Enhanced understanding of additive chromatic number.
Abstract
The Additive Coloring Problem is a variation of the Coloring Problem where labels of are assigned to the vertices of a graph so that the sum of labels over the neighborhood of each vertex is a proper coloring of . The least value for which admits such labeling is called \emph{additive chromatic number} of . This problem was first presented by Czerwi\'nski, Grytczuk and \.Zelazny who also proposed a conjecture that for every graph , the additive chromatic number never exceeds the classic chromatic number. Up to date, the conjecture has been proved for complete graphs, trees, non-3-colorable planar graphs with girth at least 13 and non-bipartite planar graphs with girth at least 26. In this work, we show that the conjecture holds for split graphs. We also present exact formulas for computing the additive chromatic number for some subfamilies of split…
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.
