The geodetic hull number is hard for chordal graphs

DOI10.1016/j.endm.2017.10.050zbMath1383.05064arXiv1704.02242OpenAlexW2606986971MaRDI QIDQ2413187

Dieter Rautenbach, Mitre C. Dourado, Lucia Draque Penso, Stéphane Bessy

Publication date: 9 April 2018

Full work available at URL: https://arxiv.org/abs/1704.02242

zbMATH Keywords

shortest pathchordal graphsgeodesic convexityhull number

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (1)

On the hardness of finding the geodetic number of a subcubic graph

Cites Work

• Unnamed Item
• Hull number: \(P_5\)-free graphs and reduction rules
• On the computation of the hull number of a graph
• 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
• Convexity in Partial Cubes: The Hull Number
• Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs

This page was built for publication: The geodetic hull number is hard for chordal graphs