1. The Probabilistic Method. With an Appendix on the Life and Work of Paul Erdős;Alon,2008
2. J.C. Bermond, A. Germa, M.C. Heydemann, D. Sotteau, Hypergraphes Hamiltoniens, Problèmes Combinatoires et Théorie des Graphes, Orsay 1976, Colloq. Int. CNRS, vol. 260, 1978, pp. 39–43.
3. Modern Graph Theory;Bollobás,1998
4. J.A. Bondy, Pancyclic graphs: recent results. Infinite and finite Sets, Colloq. Honour Paul Erdös, Keszthely 1973, Colloq. Math. Soc. Janos Bolyai, vol. 10, 1975, pp. 181–188.
5. Some theorems on abstract graphs;Dirac;Proc. Lond. Math. Soc. (3),1952