1. Conditions for the existence of hamiltonian circuits in graphs based on vertex degrees;Ainouche;J. Lond. Math. Soc. (2),1985
2. Hamiltonian cycles avoiding sets of edges in a graph;Ferrara;Australas. J. Combin.,2010
3. Some extensions of Ore’s theorem;Hayes,1984
4. On hamiltonian bipartite graphs;Moon;Israel J. Math.,1963
5. On sufficient conditions for a graph to be Hamiltonian;Nara;Natur. Sci. Rep. Ochanomizu Univ.,1980