[1] AHRENS W.: Mathematische Unteгhaltungen und Spiele. Leipzig 1901.

[2] DOOB M.: Generalizations of Magic Graphs. J. Combin. Theory (B) 17, 1974, 205-217. MR 0364019 | Zbl 0271.05128

[3] GUY R. K: Monthly Research Problems. 1969-1973. Amer. Math. Monthly 80, 1973, 1120-1128. MR 1537248

[4] GUY R. К., HARARY F.: Möbius létrákról. Mat. Lapok 18, 1967, 59-60. MR 0227042

[5] GUY R. К., HARARY F.: On the Möbius Ladders. Reseaгch Paper No 2, November 1966. The University of Calgary, Alberta, Canada.

[6] HARARY F.: Graph Theory. Reading, Massachusetts - Menlo Park, California-London-Don Mills, Ontario 1971.

[7] MURTA U.S.R.: How Many Magic Configurations aгe theгe?. Ameг. Math. Monthly 78, 1971, 1000-1002. MR 1536502

[8] SCHUBERT H.: Mathematische Mussestunden. Berlin 1941.

[9] SEDLÁČEK J.: Problem 27. In: Theoгy of Graphs and Its Applications (M. Fiedler, ed.). Pгaha. 1964, 163-164.

[10] SEDLÁČEК J.: On the Skeletons of a Graph or Digraph. In: Combinatorial Structures and Theiг Applications (R. Guy, H. Hanani, N. Saueг, J. Schonheim, eds.). New York-London-Paгis 1970, 387-391.

[11] SIERPIŃDКI W.: Teoria liczb. Warszawa 1959.

[12] STANLEY R. p.: Linear Homogeneous Diophantine Equations and Magic Labeling of Gгaphs. Duke Math. J. 40, 1973, 607-632. MR 0317970

[13] STEWART B. M.: Magic Graphs. Canad. J. Math. 18, 1966, 1031-1059. MR 0197358 | Zbl 0149.21401

[14] STEWART B. M.: Magic Sets. In: Graph Theory and Applications (Y. Alavi, D. R. Lick, A. T. White, eds.). Berlin-Heidelberg-New York 1972, 292-296. MR 0340117 | Zbl 0247.05161

[15] STEWART B. M.: Supeгmagic Complete Graphs. Canad. J. Math. 19, 1967, 427-438. MR 0209180

[16] ŠAJDA J.: O jednom algoritme z oblasti ohodnotených grafov. Mat. Čas. 19, 1969, 63-87.

[17] WAGNER, K: Graphentheorie. Hochschultaschenbücher, Band 248, Bibliographisches Institut, Mannheim-Wien-Zurich 1970. MR 0282850 | Zbl 0195.54103