Hull number: P₅-free graphs and reduction rules

DOI10.1016/J.DAM.2015.03.019zbMATH Open1339.05064OpenAlexW2176173494MaRDI QIDQ299077FDOQ299077

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

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

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)

Cites Work

• Algorithmic meta-theorems for restrictions of treewidth
• Parametrized complexity theory.
• On the computation of the hull number of a graph
• The hull number of a graph
• Dominating subgraphs in graphs with some forbidden structures
• On the hull sets and hull number of the Cartesian product of 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
• The pre-hull number and lexicographic product
• On the geodetic and the hull numbers in strong product graphs

Cited In (15)

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

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)