Y. Ashkenazi, C 3 saturated graphs, Discrete Math, pp.152-158, 2005.

C. A. Barefoot, L. H. Clark, R. C. Entringer, T. D. Porter, and L. A. , Székely and Zs. Tuza, Cyclesaturated graphs of minimum size. Selected papers in honour of Paul Erd? os on the occasion of his 80th birthday, Discrete Math, pp.150-181, 1993.

T. Bohman, M. Fonoberova, and O. Pikhurko, The saturation function of complete partite graphs, Journal of Combinatorics, vol.1, issue.2, pp.149-170, 2010.
DOI : 10.4310/JOC.2010.v1.n2.a5

B. Bollobás, On generalized graphs, Acta Mathematica Academiae Scientiarum Hungaricae, vol.15, issue.3-4, pp.447-452, 1965.
DOI : 10.1007/BF01904851

J. A. 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

Y. Chen, -saturated graphs, Journal of Graph Theory, vol.30, issue.2, pp.111-126, 2009.
DOI : 10.1002/jgt.20372

URL : https://hal.archives-ouvertes.fr/hal-00109057

Y. Chen, Minimum K 2,3 -saturated graphs

G. Chen, R. Faudree, and R. Gould, Saturation numbers of books, Electron, Research Paper 118, 2008.

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

L. H. Clark, R. C. Entringer, and H. D. Shapiro, Smallest maximally nonhamiltonian graphs II, Graphs and Combin, pp.225-231, 1992.

A. Dudek, G. Y. Katona, and A. P. 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

URL : http://doi.org/10.1016/j.dam.2005.05.035

A. Dudek, G. Y. Katona, and A. Zak, Hamilton-chain saturated hypergraphs, Discrete Math, pp.310-1172, 2010.
DOI : 10.1016/j.disc.2009.11.014

URL : http://doi.org/10.1016/j.disc.2009.11.014

P. Erd?-os, Z. Füredi, . Zs, and . Tuza, Saturated r-uniform hypergraphs, Discrete Math, pp.95-104, 1991.

P. Erd?-os, A. Hajnal, and J. W. Moon, A Problem in Graph Theory, The American Mathematical Monthly, vol.71, issue.10, pp.1107-1110, 1964.
DOI : 10.2307/2311408

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

Z. Füredi and Y. Kim, Cycle-Saturated Graphs with Minimum Number of Edges, Journal of Graph Theory, vol.30, issue.2
DOI : 10.1002/jgt.21668

R. Gould, T. ?uczak, and J. Schmitt, Constructive upper bounds for cycle-saturated graphs of minimum size, Research Paper 29, p.pp, 2006.

G. Y. Katona, Hamiltonian chains in hypergraphs, DMTCS proc. AE, pp.345-350, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184433

G. Y. Katona and H. Kierstead, Hamiltonian chains in hypergraphs, Journal of Graph Theory, vol.55, issue.3, pp.205-212, 1999.
DOI : 10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O

URL : https://hal.archives-ouvertes.fr/hal-01184433

O. Pikhurko, Results and open problems on minimum saturated hypergraphs, Ars Combin, vol.72, pp.111-127, 2004.

O. Pikhurko, The Minimum Size of Saturated Hypergraphs, Combinatorics, Probability and Computing, vol.8, issue.5, pp.483-492, 1999.
DOI : 10.1017/S0963548399003971

. Zs and . Tuza, C 4 -saturated graphs of minimum size, Acta Univ. Carolin. Math. Phys, vol.30, pp.161-167, 1989.

L. Xiaohui, J. Wenzhou, Z. Chengxue, and Y. Yuansheng, On smallest maximally nonhamiltonian graphs, Ars Combin, vol.45, pp.263-270, 1997.