Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.27624

Proper Additive Edge Colorings of Regular Graphs

Ian Gossett
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that if $G$ is a $d$-regular Vizing-class-1 graph, then the proper additive chromatic index of $G$, denoted $η'_p(G)$, is equal to its chromatic index. This verifies that a strengthening of the Additive Coloring Conjecture of Czerwiński et al. holds for line graphs of $d$-regular Vizing-class-1 graphs. We show that if $G$ is a $d$-regular Vizing-class-2 graph, $η'_{p}(G)\leq \frac{(2^{\lceil \log_2 (d+1)\rceil})^2+2}{3}$, and if $G$ is a $d$-regular Vizing-class-2 graph that admits a proper edge-coloring with a smallest color class of size $r$ and $\text{girth}(G)\geq 6r-5$, then $η_p'(G)\leq 2d$, among other results.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ian Gossett. 2026-06-16. Proper Additive Edge Colorings of Regular Graphs. https://arxiv.org/abs/2605.27624

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗