B. Bollobás and A. Thomason, Weakly Pancyclic Graphs, Journal of Combinatorial Theory, Series B, vol.77, issue.1, pp.121-137, 1999.
DOI : 10.1006/jctb.1999.1916

J. A. Bondy, Properties of graphs with constraints on degrees, Stud. Sci. Math. Hung, vol.4, pp.473-475, 1969.

J. A. Bondy and U. S. Murty, Graph Theory with Applications, 1980.
DOI : 10.1007/978-1-349-03521-2

S. Brandt, A sufficient condition for all short cycles, Discrete Applied Mathematics, vol.79, issue.1-3, pp.63-66, 1997.
DOI : 10.1016/S0166-218X(97)00032-2

G. A. Dirac, Some Theorems on Abstract Graphs, Proc. Lond, pp.69-81, 1952.
DOI : 10.1112/plms/s3-2.1.69

P. Erd?-os, T. J. Reid, R. Schelp, and W. Staton, Sizes of graphs with induced subgraphs of large maximum degree, Discrete Mathematics, vol.158, issue.1-3, pp.283-286, 1996.
DOI : 10.1016/0012-365X(95)00008-K

T. Ho, C. Lin, J. J. Tan, D. F. Hsu, and L. Hsu, On the extremal number of edges in hamiltonian connected graphs, Applied Mathematics Letters, vol.23, issue.1, pp.26-29, 2010.
DOI : 10.1016/j.aml.2009.03.025

T. Ho, C. Lin, J. J. Tan, D. F. Hsu, and L. Hsu, On the extremal number of edges in hamiltonian connected graphs, Applied Mathematics Letters, vol.23, issue.1, pp.1659-1665, 2011.
DOI : 10.1016/j.aml.2009.03.025

L. Hsu and C. Lin, Graph Theory and Interconnection Networks, 2009.

S. Kao, K. Hsu, and L. Hsu, Cubic planar hamiltonian graphs of various types, Discrete Mathematics, vol.306, issue.13, pp.1364-1389, 2006.
DOI : 10.1016/j.disc.2005.08.011

D. R. Lick, A sufficient condition for hamiltonian connectedness, Journal of Combinatorial Theory, vol.8, issue.4, pp.444-445, 1970.
DOI : 10.1016/S0021-9800(70)80037-0

O. Ore, Note on Hamilton Circuits, The American Mathematical Monthly, vol.67, issue.1, p.55, 1960.
DOI : 10.2307/2308928

O. Ore, Hamilton-connected graphs, J. Math. Pures Appl, vol.42, pp.21-27, 1963.