An antimagic labeling of a graph G is a bijection f : E(G) → {1, . . . , |E(G)|} such that the weights w(x) = ∑y∼x f(y) distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every ...