J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio et al., On the hull number of some graph classes, Theoretical Computer Science, vol.475, pp.475-476, 2013.
DOI : 10.1016/j.tcs.2012.12.035
URL : https://hal.archives-ouvertes.fr/hal-00770650

J. Araujo, G. Morel, L. Sampaio, R. Soares, and V. Weber, Hull number: -free graphs and reduction rules, Electronic Notes in Discrete Mathematics, vol.44, pp.67-73, 2013.
DOI : 10.1016/j.endm.2013.10.011
URL : https://hal.archives-ouvertes.fr/hal-00799868

H. Bandelt, Graphs with intrinsic s3 convexities, Journal of Graph Theory, vol.48, issue.2, pp.215-228, 1989.
DOI : 10.1002/jgt.3190130208

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, Computers & Mathematics with Applications, vol.60, issue.11, pp.3020-3031, 2010.
DOI : 10.1016/j.camwa.2010.10.001

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

C. C. Centeno, L. D. Penso, D. Rautenbach, and V. G. Pereira-de-sá, Geodetic Number versus Hull Number in $P_3$-Convexity, SIAM Journal on Discrete Mathematics, vol.27, issue.2, pp.717-731, 2013.
DOI : 10.1137/110859014

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

R. Cordovil and D. Forge, Flipping in acyclic and strongly connected graphs, 2007.

R. P. Dilworth, Lattices with unique irreducible decompositions, Ann. of Math, issue.2, pp.41-771, 1940.
DOI : 10.2307/1968857

D. ?. Djokovi´cdjokovi´c, Distance-preserving subgraphs of hypercubes, Journal of Combinatorial Theory, Series B, issue.3, pp.14-263, 1973.

M. C. Dourado, J. G. Gimbel, J. Kratochvíl, F. Protti, and J. L. Szwarcfiter, On the computation of the hull number of a graph, Discrete Mathematics, vol.309, issue.18, pp.5668-5674, 2009.
DOI : 10.1016/j.disc.2008.04.020

M. C. Dourado, F. Protti, D. Rautenbach, and J. L. Szwarcfiter, On the Hull Number of Triangle-Free Graphs, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.2163-2172, 2009.
DOI : 10.1137/090751797

D. Eppstein, Isometric Diamond Subgraphs, Lecture Notes in Computer Science, vol.5417, pp.384-389, 2009.
DOI : 10.1007/978-3-642-00219-9_37
URL : http://arxiv.org/abs/0807.2218

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

S. Felsner, K. Knauer, and ?. Uld-lattices, ULD-Lattices and ??-Bonds, Combinatorics, Probability and Computing, vol.4, issue.05, pp.707-724, 2009.
DOI : 10.1137/0406038

R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Information Processing Letters, vol.12, issue.3, pp.133-137, 1981.
DOI : 10.1016/0020-0190(81)90111-3

K. Fukuda and K. Handa, Antipodal graphs and oriented matroids, Discrete Math, pp.245-256, 1990.
DOI : 10.1016/0012-365x(93)90159-q
URL : http://doi.org/10.1016/0012-365x(93)90159-q

R. L. Graham and H. O. Pollak, On the addressing problem for loop switching, Bell System Tech, J, vol.50, pp.2495-2519, 1971.

M. Grötschel, L. Lovász, and A. Schrijver, Polynomial Algorithms for Perfect Graphs, Ann. Discrete Math, vol.21, pp.325-356, 1984.
DOI : 10.1016/S0304-0208(08)72943-8

K. Handa, Topes of oriented matroids and related structures, Publications of the Research Institute for Mathematical Sciences, vol.29, issue.2, pp.235-266, 1993.
DOI : 10.2977/prims/1195167272

C. Hernando, T. Jiang, M. Mora, I. M. Pelayo, and C. Seara, On the Steiner, geodetic and hull numbers of graphs, Discrete Math, pp.139-154, 2005.

R. Impagliazzo and R. Paturi, Complexity of k-SAT, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), pp.367-375, 2001.
DOI : 10.1109/CCC.1999.766282

M. M. Kanté and L. Nourine, Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs, SOFSEM 2013: Theory and Practice of Computer Science, pp.268-279, 2013.

S. Klav?ar and S. Shpectorov, Convex excess in partial cubes, Journal of Graph Theory, vol.43, issue.4, pp.356-369, 2012.
DOI : 10.1002/jgt.20589

B. Monjardet, A use for frequently rediscovering a concept, Order, vol.14, issue.9, pp.415-417, 1985.
DOI : 10.1007/BF00582748

R. P. Stanley, Two poset polytopes, Discrete & Computational Geometry, vol.31, issue.1, pp.9-23, 1986.
DOI : 10.1007/BF02187680

W. T. Trotter, Combinatorics and partially ordered sets, 1992.

P. M. Winkler, Isometric embedding in products of complete graphs, Discrete Applied Mathematics, vol.7, issue.2, pp.221-225, 1984.
DOI : 10.1016/0166-218X(84)90069-6

M. Yannakakis, The Complexity of the Partial Order Dimension Problem, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.3, pp.351-358, 1982.
DOI : 10.1137/0603036

G. M. Ziegler, Lectures on polytopes, Graduate Texts in Mathematics, vol.152, 1995.
DOI : 10.1007/978-1-4613-8431-1