On the hull number of triangle-free graphs

MC Dourado, F Protti, D Rautenbach… - SIAM Journal on Discrete …, 2010 - SIAM
… The hull number h(G) of a graph G is the smallest cardinality of a set of vertices whose convex
hull is the vertex set of G. For a connected triangle-free graph G of order n and diameter d …

[HTML][HTML] Hull number: P5-free graphs and reduction rules

J Araújo, G Morel, L Sampaio, R Soares… - Discrete Applied …, 2016 - Elsevier
… compute the hull number of any P 5 -free triangle-free graph. … algorithm to compute the hull
number of any graph G , where … compute the hull number of any P 5 -free triangle-free graph. …

Hull number: P5-free graphs and reduction rules

J Araujo, G Morel, L Sampaio, R Soares… - Electronic Notes in …, 2013 - Elsevier
… the hull number of any P4-free graph, ie any graphhull number of any P5-free triangle-free
graph. In Section 4, we show four reduction rules to obtain, from a graph G, another graph

[HTML][HTML] On the geodetic hull number of Pk-free graphs

MC Dourado, LD Penso, D Rautenbach - Theoretical Computer Science, 2016 - Elsevier
number of a given P 5 -free graph is NP-hard. Furthermore, we show that the geodetic hull
number can be computed in polynomial time for { paw , P 5 } -free graphs, triangle-free graphs

On the hull number of some graph classes

J Araujo, V Campos, F Giroire, N Nisse… - Theoretical Computer …, 2013 - Elsevier
… bounds on the hull numbers. In particular, we show that the hull number of an n-node graph
G without simplicial … Bounds on the hull number of triangle-free graphs are shown in [6]. The …

[PDF][PDF] Hull number: P5-free graphs and reduction rules

JAGML Sampaio, RSV Weber - 2012 - Citeseer
… the hull number of any P4-free graph, ie any graph … the hull number of any P5-free triangle-free
graph. In Section 4, we show four reduction rules to obtain, from a graph G, another graph

On the hull number of some graph classes

J Araujo, V Campos, F Giroire, L Sampaio… - Electronic Notes in …, 2011 - Elsevier
hull number of triangle-free graphs. In [5], it is also proved that the hull number of unit
interval graphs… We reduce SAT to Hull Number in bipartite graphs by creating an instance as …

[HTML][HTML] On the computation of the hull number of a graph

MC Dourado, JG Gimbel, J Kratochvíl, F Protti… - Discrete …, 2009 - Elsevier
… In this section we prove that deciding whether the hull number of a graph G is less than or
… We will show that F is satisfiable if and only if the hull number of G is less than or equal to n …

On the P3-hull number of Hamming graphs

B Brešar, M Valencia-Pabon - Discrete Applied Mathematics, 2020 - Elsevier
… -hull set in G is called the P 3 -hull number of G . In this paper, we prove that the P 3 -hull
number of a Hamming graphgraphs K r i , with r i > 1 for 1 ≤ i ≤ n , is equal to ⌈ n ∕ 2 ⌉ + 1 . …

Triangle-free simple 2-matchings in subcubic graphs

D Hartvigsen, Y Li - International Conference on Integer Programming and …, 2007 - Springer
… Our main results are, for graphs with maximum degree 3, a complete description of the
convex hull of incidence vectors of triangle-free simple 2-matchings and a strongly polynomial …