L. Babel and S. Olariu, On the structure of graphs with few P4s, Discrete Applied Mathematics, vol.84, issue.1-3, pp.1-13, 1998.
DOI : 10.1016/S0166-218X(97)90120-7

J. A. Bondy and U. S. Murty, Graph Theory, Graduate Texts in Mathematics, vol.244, 2008.
DOI : 10.1007/978-1-84628-970-5

G. B. Cagaanan, S. R. Canoy, and J. , On the hull sets and hull number of the cartesian product of graphs, Discrete Mathematics, vol.287, issue.1-3, pp.141-144, 2004.
DOI : 10.1016/j.disc.2004.06.014

G. Chartrand, J. F. Fink, and P. Zhang, The hull number of an oriented graph, International Journal of Mathematics and Mathematical Sciences, vol.2003, issue.36, pp.2265-2275, 2003.
DOI : 10.1155/S0161171203210577

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, 2006.
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, 2010.
DOI : 10.1137/090751797

M. G. Everett and S. B. Seidman, The hull number of a graph, Discrete Mathematics, vol.57, issue.3, pp.217-223, 1985.
DOI : 10.1016/0012-365X(85)90174-8

M. Farber and R. E. Jamison, Convexity in Graphs and Hypergraphs, SIAM Journal on Algebraic Discrete Methods, vol.7, issue.3, pp.433-444, 1986.
DOI : 10.1137/0607049

V. Giakoumakis and J. Vanherpe, On extended P4-reducible and extended P4-sparse graphs, Theoretical Computer Science, vol.180, issue.1-2, pp.269-286, 1997.
DOI : 10.1016/S0304-3975(96)00220-4
URL : https://hal.archives-ouvertes.fr/hal-00467644

R. M. Mcconnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999.
DOI : 10.1016/S0012-365X(98)00319-7

M. Tedder, D. G. Corneil, M. Habib, and C. Paul, Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pp.634-645, 2008.
DOI : 10.1007/978-3-540-70575-8_52