Regular graphs of odd degree are antimagic

Daniel W. Cranston

An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\dots ,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to…