Borel Vizing's Theorem for Graphs of Subexponential Growth

We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $Δ(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be properly edge-colored using $Δ(G) + 1$ colors by an $O(\log^\ast n)$-round deterministic distributed algorithm in the $\mathsf{LOCAL}$ model, where the implied constants in the $O(\cdot)$ notation are determined by a bound on the growth rate of $G$.