Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem

Daniel W. Cranston

A labeling of a graph is a bijection from $E(G)$ to the set $\{1,2,...,|E(G)|\}$. A labeling is \textit{antimagic} if for any distinct vertices $u$ and $v$, the sum of the labels…