Hull number: \(P_5\)-free graphs and reduction rules
From MaRDI portal
Publication:299077
DOI10.1016/j.dam.2015.03.019zbMath1339.05064OpenAlexW2176173494MaRDI QIDQ299077
F. Blanchet-Sadri, M. Dambrine
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.03.019
geodesic convexityparameterized complexitygraph convexityhull numberlexicographic product\(P_5\)-free graphsneighborhood diversity
Related Items (13)
A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ Parameterized Complexity of Geodetic Set ⋮ On the geodetic hull number of \(P_{k}\)-free graphs ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ Computing the hull number in toll convexity ⋮ The geodetic hull number is hard for chordal graphs ⋮ The Geodetic Hull Number is Hard for Chordal Graphs ⋮ On the hardness of finding the geodetic number of a subcubic graph ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ The hull number in the convexity of induced paths of order \(3\) ⋮ Parameterized Complexity of Geodetic Set
Cites Work
- Unnamed Item
- The pre-hull number and lexicographic product
- On the geodetic and the hull numbers in strong product graphs
- On the computation of the hull number of a graph
- The hull number of a graph
- Dominating subgraphs in graphs with some forbidden structures
- Algorithmic meta-theorems for restrictions of treewidth
- On the hull sets and hull number of the Cartesian product of graphs
- On the hull number of some graph classes
- Parametrized complexity theory.
- On the Hull Number of Triangle-Free Graphs
This page was built for publication: Hull number: \(P_5\)-free graphs and reduction rules
