Trees whose even-degree vertices induce a path are antimagic

Antoni Lozano, Mercè Mora, Carlos Seara +1

An antimagic labeling a connected graph $G$ is a bijection from the set of edges $E(G)$ to $\{1,2,\dots ,|E(G)|\}$ such that all vertex sums are pairwise distinct, where the vertex…