1. Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency;Nash-Williams,1971
2. Hamiltonian lines in graphs whose vertices have sufficiently large valencies;Nash-Williams,1970
3. Edge-disjoint Hamiltonian cycles in graphs;Christofides;J. Combin. Theory Ser. B,2012
4. Some theorems on abstract graphs;Dirac;Proc. Lond. Math. Soc. (3),1952
5. Minimum degree of a graph and the existence of k-factors;Katerinis;Proc. Indian Acad. Sci. Math. Sci.,1985