magic graphs; supermagic graphs; line graphs
A graph is called magic (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. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
 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
 N. Hartsfield, G. Ringel: Pearls in Graph Theory
. Academic Press, San Diego, 1990. MR 1069559
 J. Ivančo: On supermagic regular graphs
. Math. Bohem. 125 (2000), 99–114. MR 1752082
 S. Jezný, M. Trenkler: Characterization of magic graphs
. Czechoslovak Math. J. 33 (1988), 435–438. MR 0718926
 J. Sedláček: On magic graphs
. Math. Slovaca 26 (1976), 329–335. MR 0434889
 J. Sedláček: Problem 27. Theory of Graphs and Its Applications, Proc. Symp. Smolenice. Praha, (1963), 163–164.