Regular graphs are antimagic

In this note we prove - with a slight modification of an argument of Cranston et al. \cite{cranston} - that $k$-regular graphs are antimagic for $k\ge 2$.