[1] M. Behzad, G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston (1972). MR 0432461

[2] G. Chartrand A. M. Hobbs H. A. Jung S. F. Kapoor, and C. St. J. A. Nash-Williams: The square of a block is Hamiltonian connected. J. Combinatorial Theory 16 (1974), 290-292. DOI 10.1016/0095-8956(74)90075-6 | MR 0345865

[3] H. Fleischner: The square of every two-connected graph is Hamiltonian. J. Combinatorial Theory (Series B) 16 (1974), 29-34. DOI 10.1016/0095-8956(74)90091-4 | MR 0332573 | Zbl 0256.05121

[4] A. M. Hobbs: Some hamiltonian results in powers of graphs. J. Res. Nat. Bur. Standards 77B (1973), 1-10. MR 0337688 | Zbl 0262.05124

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