Hull number: P₅-free graphs and reduction rules

DOI10.1016/J.DAM.2015.03.019MaRDI QIDQ299077zbMATH OpenOpenAlexFDO

Authors J. Araujo, G. Morel, L. Sampaio, R. Soares, V. Weber

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

zbMATH Keywords

geodesic convexityparameterized complexitygraph convexityhull numberlexicographic product\(P_5\)-free graphsneighborhood diversity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Recommendations

• On the hull number of some graph classes
• On the computation of the hull number of a graph
• On the hull number of some graph classes
• On the geodetic hull number of \(P_{k}\)-free graphs
• On the hull number of triangle-free graphs

Cites work

• Algorithmic meta-theorems for restrictions of treewidth
• Dominating subgraphs in graphs with some forbidden structures
• On the computation of the hull number of a graph
• On the geodetic and the hull numbers in strong product graphs
• On the hull number of some graph classes
• On the hull number of some graph classes
• On the hull number of triangle-free graphs
• On the hull sets and hull number of the Cartesian product of graphs
• Parametrized complexity theory.
• The hull number of a graph
• The pre-hull number and lexicographic product

Cited in

(15)

• The geodetic hull number is hard for chordal graphs
• On the \(P_3\)-hull number of some products of graphs
• Computing the hull number in toll convexity
• Geodetic convexity parameters for graphs with few short induced paths
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
• Geodetic convexity parameters for \((q, q - 4)\)-graphs
• Parameterized complexity of geodetic set
• The hull number in the convexity of induced paths of order \(3\)
• The geodetic hull number is hard for chordal graphs
• On the computation of the hull number of a graph
• A polynomial time algorithm for geodetic hull number for complementary prisms
• On the hardness of finding the geodetic number of a subcubic graph
• Parameterized Complexity of Geodetic Set
• On the hull number of triangle-free graphs
• On the geodetic hull number of \(P_{k}\)-free graphs

This page was built for publication: Hull number: \(P_5\)-free graphs and reduction rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299077)