1. Bauer D., Broersma H.J., van den Heuvel J., Veldman H.J.: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Math. 141, 1–10 (1995)
2. Bermond J.C.: On hamiltonian walks. Congr. Numer. 15, 41–51 (1976)
3. Bondy, J.A.: Longest paths and cycles in graphs with high degree, Research Report CORR 80-16, Department of Combinatorics and Optimization, University of Waterloo, Waterloo (1980)
4. Bondy J.A.: Basic graph theory: paths and circuits. In: Graham, R., Grőtshel, M., Lovász, L. (eds) Handbook of Combinatorics, vol. I, pp. 5–110. Elsevier, Amsterdam (1995)
5. Bondy J.A., Locke S.C.: Relative length of paths and cycles in 3-connected graphs. Discrete Math. 33, 111–122 (1981)