supermagic graphs; complete multipartite graphs; products of graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
 M. Bača I. Holländer, Ko-Wei Lih: Two classes of super-magic graphs
. J. Combin. Math. Combin. Comput. 23 (1997), 113-120. MR 1432751
 S. Jezný M. Trenkler: Characterization of magic graphs
. Czechoslovak Math. J. 33 (1983), 435-438. MR 0718926
 J. Sedláček: Problem 27. Theory of Graphs and Its Applications, Proc. Symp. Smolenice. Praha, 1963, pp. 163-164.
 J. Sedláček: On magic graphs
. Math. Slovaca 26 (1976), 329-335. MR 0434889