A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1, 2, . . . , |V (G)| + |E(G)|} such that the sum f(x) + f(xy) + f(y) for any xy in E(G) is constant. Such ...