Proper Additive Edge Colorings of Regular Graphs
Combinatorics
2026-05-28 v1
Abstract
We show that if is a -regular Vizing-class-1 graph, then the proper additive chromatic index of , denoted , is equal to its chromatic index. This verifies that a strengthening of the Additive Coloring Conjecture of Czerwi\'{n}ski et al. holds for line graphs of -regular Vizing-class-1 graphs. We show that if is a -regular Vizing-class-2 graph, , and if is a -regular Vizing-class-2 graph that admits a proper edge-coloring with a smallest color class of size and , then , among other results.
Cite
@article{arxiv.2605.27624,
title = {Proper Additive Edge Colorings of Regular Graphs},
author = {Ian Gossett},
journal= {arXiv preprint arXiv:2605.27624},
year = {2026}
}