]. J. Acg-+-13, V. Araujo, F. Campos, N. Giroire, L. Nisse et al., On the hull number of some graph classes, Theoret. Comput. Sci, vol.475, pp.1-12, 2013.

M. Albenque and K. Knauer, Convexity in partial cubes: the hull number, Discrete Math, vol.339, issue.2, pp.866-876, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01457880

J. Araújo, G. Morel, L. Sampaio, R. P. Soares, and V. Weber, Hull number: P 5 -free graphs and reduction rules, vol.210, pp.171-175, 2016.

A. V. Arkhangel'skij, L. S. Pontryagin, and R. V. Gamkrelidze, General topology. I. Basic concepts and constructions. Dimension theory, 1990.

J. Balogh and G. Pete, Random disease on the square grid, Random Struct. Algorithms, vol.13, issue.3-4, pp.409-422, 1998.

A. Björner, M. Günter, and . Ziegler, Introduction to greedoids, Matroid applications, pp.284-357, 1992.

S. R. Canoy, J. , and G. B. Cagaanan, On the hull number of the composition of graphs, Ars Combin, vol.75, pp.113-119, 2005.

S. R. Canoy, G. B. Cagaanan, and S. V. Gervacio, Convexity, geodetic, and hull numbers of the join of graphs, Util. Math, vol.71, pp.143-159, 2006.

J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, and M. L. Puertas, On the geodetic and the hull numbers in strong product graphs, Comput. Math. Appl, vol.60, issue.11, pp.3020-3031, 2010.

G. Chartrand, F. Harary, and P. Zhang, On the hull number of a graph, Ars Combin, vol.57, pp.129-138, 2000.

C. C. Centeno, L. D. Penso, D. Rautenbach, and V. G. Pereira-de-sá, Geodetic Number versus Hull Number in P 3 -Convexity, SIAM J. Discrete Math, vol.27, issue.2, pp.717-731, 2013.

G. Chartrand and P. Zhang, On graphs with a unique minimum hull set, Discuss. Math. Graph Theory, vol.21, issue.1, pp.31-42, 2001.

G. Rodney, M. R. Downey, and . Fellows, Parameterized Complexity, 2012.

. C. Dgk-+-09]-m, J. G. Dourado, J. Gimbel, F. Kratochvíl, J. L. Protti et al., On the computation of the hull number of a graph, Disc. Maths, vol.309, issue.18, pp.5668-5674, 2009.

M. C. Dourado, F. Protti, D. Rautenbach, and J. L. Szwarcfiter, On the hull number of triangle-free graphs, SIAM J. Discrete Math, vol.23, issue.10, pp.2163-2172, 2009.

I. Dinur and D. Steurer, Analytical approach to parallel repetition, 46th annual ACM symposium on theory of computing (STOC '14), pp.624-633, 2014.
DOI : 10.1145/2591796.2591884

M. G. Everett and S. B. Seidman, The hull number of a graph, Discrete Math, vol.57, issue.3, pp.217-223, 1985.

J. Flum and M. Grohe, Parameterized Complexity Theory (Texts in Theoretical Computer Science, An EATCS Series, 2006.

M. Farber and R. E. Jamison, Convexity in graphs and hypergraphs, SIAM J. Algebraic Discrete Methods, vol.7, pp.433-444, 1986.
DOI : 10.1137/0607049

P. Flocchini, E. Lodi, F. Luccio, L. Pagli, and N. Santoro, Dynamic monopolies in tori, Discrete Appl. Math, vol.137, issue.2, pp.197-212, 2004.
DOI : 10.1016/s0166-218x(03)00261-0

URL : https://doi.org/10.1016/s0166-218x(03)00261-0

E. Hertel, Convexity in finite metric spaces, Geom. Dedicata, vol.52, issue.3, pp.215-220, 1994.
DOI : 10.1007/bf01278473

C. Hernando, T. Jiang, M. Mora, I. M. Pelayo, and C. Seara, On the Steiner, geodetic and hull numbers of graphs, HJM + 05, vol.293, pp.139-154, 2005.

F. Harary, E. Loukakis, and C. Tsouros, The geodetic number of a graph, Math. Comput. Modelling, vol.17, issue.11, pp.89-95, 1993.

Y. Hassin and D. Peleg, Distributed probabilistic polling and applications to proportionate agreement, Inf. Comput, vol.171, issue.2, pp.248-268, 2001.
DOI : 10.1007/3-540-48523-6_37

A. J. Paul, F. S. Dreyer, and . Roberts, Irreversible k-threshold processes: Graphtheoretical threshold models of the spread of disease and of opinion, Discrete Appl. Math, vol.157, issue.7, pp.1615-1627, 2009.

D. Kempe, J. Kleinberg, and T. Andévaand´andéva, Maximizing the spread of influence through a social network, Theory Comput, vol.11, pp.105-147, 2015.

K. Khoshkhah, H. Soltani, and M. Zaker, Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks, Discrete Appl. Math, vol.171, pp.81-89, 2014.

K. Nehmé, P. Valtchev, M. H. Rouane, and R. Godin, On computing the minimal generator family for concept lattices and icebergs, 3 rd int. conf. on Formal concept analysis (ICFCA'05), pp.192-207, 2005.

C. H. Papadimitriou, Computational complexity. Academic Internet Publ, 2007.

C. H. Papadimitriou and M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. Syst. Sci, vol.53, issue.2, pp.161-170, 1996.

L. N. Shevrin, A. Ya, and . Ovsyannikov, Semigroups and their subsemigroup lattices, 1996.