1. Über Euler-Linien unendlicher Graphen;Erdös;J. Math. Phys. Mass. Inst. Technology,1938
2. The square of every two-connected graph is Hamiltonian;Fleischner;J. Combinatorial Theory,1974
3. In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts, Monatsh.;Fleischner;Math.,1976
4. Über unendliche Wege in Graphen;Halin;Math. Ann.,1964
5. Graph Theory;Harary,1969