%0 Journal Article
%T Regular graphs are antimagic
%A Krist¨®f B¨¦rczi
%A Attila Bern¨˘th
%A M¨˘t¨¦ Vizer
%J Computer Science
%D 2015
%I arXiv
%X 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$.
%U http://arxiv.org/abs/1504.08146v1