Year: 2026
Type: preprint
Abstract: An $r$-dynamic coloring of a graph $G$ is a proper vertex coloring in which every vertex $v$ sees at least $\min\{r,d(v)\}$ distinct colors in its neighborhood. The minimum number of colors in such a coloring is the $r$-dynamic chromatic number $χ_r^d(G)$. We study dynamic colorings of regular graphs. A straighforward observation shows that $χ_r^d(G)=χ(G^2)$, for any $r$-regular graph $G$. We prove that $χ_3^d(G)=χ(G^2)\le6$ for every claw-free cubic graph $G$, and the bound is sharp. For Hamiltonian claw-free cubic graphs, we improve the bound to $5$ apart from four explicit exceptions. We also determine exactly the $r$-dynamic chromatic number of the $4$-regular circulant graph $C_p(1,3)$ for each $r\in\{2,3,4\}$. In particular, the case $r=4$ determines $χ(C^2_p(1,3))$.
Source: arXiv (Cornell University)
Authors: Gutierrez, Juan, Ugarte, Grover
Institution: Universidad de Ingeniería y Tecnología
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7220976856