[1] M. Behzad K. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston 1971. MR 0432461

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

[3] L. Nebeský: Algebraic Properties of Trees. Charles University, Praha 1969. MR 0274210

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

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