Klav?ar and I. Peterin, Convex sets in lexicographic products of graphs, Graphs and Combinatorics, pp.1-8, 2011. ,
On the hull number of some graph classes, Theoretical Computer Science, vol.475, 2011. ,
DOI : 10.1016/j.tcs.2012.12.035
URL : https://hal.archives-ouvertes.fr/inria-00635032
On the hull number of some graph classes, Sixth European Conference on Combinatorics, Graph Theory and Applications, pp.49-55, 2011. ,
DOI : 10.1016/j.tcs.2012.12.035
URL : https://hal.archives-ouvertes.fr/inria-00635032
Dominating cliques in P5-free graphs, Periodica Mathematica Hungarica, vol.3, issue.4, pp.303-308, 1990. ,
DOI : 10.1007/BF02352694
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
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
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
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
The hull number of a graph, Discrete Mathematics, vol.57, issue.3, pp.217-223, 1985. ,
DOI : 10.1016/0012-365X(85)90174-8
Parameterized Complexity Theory, Theoretical Computer Science. An EATCS Series, 2006. ,
Using neighborhood diversity to solve hard problems, 2012. ,
Algorithmic Meta-theorems for Restrictions of Treewidth, Algorithmica, vol.4, issue.3, pp.19-37, 2012. ,
DOI : 10.1007/s00453-011-9554-x
The pre-hull number and lexicographic product, Discrete Mathematics, vol.312, issue.14, pp.2153-2157, 2010. ,
DOI : 10.1016/j.disc.2011.08.031