1. Conditions for the existence of Hamiltonian circuits in graphs based on vertex degrees;Ainouche;Journal of the London Mathematical Society (2),1985
2. Pancyclism in Hamiltonian graphs;Amar;Discrete Mathematics,1991
3. P. Ash, Dominating cycles, Hamilton cycles and cycles with many chords in 2-connected graphs, Ph.D. Thesis, Goldsmiths’ College, London, 1985.
4. Dominating cycles in 2-connected bipartite graphs;Ash,1984
5. Ming Aung, On the circumference of triangle-free and regular graphs, Ph.D. Thesis, Technischen Universitat Berlin, 1988.