[1] Fleischner H.: The square of every nonseparable graph is Hamiltonian. Bull. Am. Math. Soc., 77 (1971), 1052-1054. MR 0284364 | Zbl 0223.05124

[2] Fleischner H., Hobbs A. M.: A necessary condition, for the square of a graph to be Hamiltonian. J. of Comb. Theory, 19, 1975, 97-118. MR 0414433 | Zbl 0315.05120

[3] Hobbs A. M.: Hamiltonian square of cacti. J. of Comb. Theory, Series B, 26 (1979), 50-65. MR 0525816

[4] Karaganis J. J.: On the cube a graph. Can. Math. Bull., 11 (1968), 295-296. MR 0230645

[5] Neuman F.: On a certain ordering of the vertices of a tree. Časopis pěst. mat., 89 (1964) 323-339. MR 0181587 | Zbl 0131.20901

[6] Ore O.: A problem regarding the tracing of graphs. Elem. Math., 6 (1951), 49-53. MR 0041418 | Zbl 0043.38503

[7] Ore O.: Theory of graphs. A. M. S., Providence, 1962. MR 0150753 | Zbl 0105.35401

[8] Sekanina M.: On an ordering of the set of vertices of a connected graph. Publ. Fac. Sc. Univ. Brno, No 412, 1960, 137-142. MR 0140095 | Zbl 0118.18903