B. Bollobás, Extremal Graph Theory, 1978.
DOI : 10.1201/b16132-57

J. Bondy, Variations on the Hamiltonian theme, Bulletin canadien de math??matiques, vol.15, issue.0, pp.57-62, 1972.
DOI : 10.4153/CMB-1972-012-3

F. Bullock, M. Frick, J. Singleton, S. Van-aardt, and C. Mynhardt, Maximal nontraceable graphs with toughness less than one, Electronic Journal of Combinatorics, pp.15-18, 2008.

A. Burger, Maximal nontraceable graphs, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00990607

L. Clark and R. Entringer, Smallest maximally nonhamiltonian graphs, Periodica Mathematica Hungarica, vol.3, issue.1, pp.57-68, 1983.
DOI : 10.1007/BF02023582

L. Clark, R. Entringer, and H. Shapiro, Smallest maximally nonhamiltonian graphs II, Graphs and Combinatorics, vol.55, issue.3, pp.225-231, 1992.
DOI : 10.1007/BF02349959

A. Dudek, G. Katona, and A. Wojda, Hamiltonian path saturated graphs with small size, Discrete Applied Mathematics, vol.154, issue.9, pp.1372-1379, 2006.
DOI : 10.1016/j.dam.2005.05.035

M. Frick and J. Singleton, Lower bound for the size of maximal nontraceable graphs, Electronic Journal of Combinatorics, vol.12, issue.1, p.32, 2005.

X. Lin, W. Jiang, C. Zhang, and Y. Yang, On smallest maximally nonhamiltonian graphs, Ars Combin, vol.45, pp.263-270, 1997.

B. Mckay, Combinatorial data page, 2013.

G. Royle, Gordon Royle's Small graphs, 2013.

Z. Skupie´nskupie´n, Hamiltonian circuits and path coverings of vertices in graphs, Colloq. Math, vol.30, pp.295-316, 1974.

Z. Skupie´nskupie´n, Hamiltonian shortage, path partitions of vertices, and matchings in a graph, Colloq. Math, vol.36, pp.305-318, 1976.

B. Zelinka, Graphs maximal with respect to absence of hamiltonian paths, Discussiones Mathematicae Graph Theory, vol.18, issue.2, pp.205-208, 1998.
DOI : 10.7151/dmgt.1076