On the hull number of some graph classes

DOI10.1016/j.tcs.2012.12.035zbMath1419.05049OpenAlexW2036683504MaRDI QIDQ1939271

R. Soares, Nicolas Nisse, Frederic Giroire, Leonardo Sampaio, Julio Araujo, Victor A. Campos

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.035

zbMATH Keywords

bipartite graphcactus graphgraph convexityhull numbercobipartite graph(\(q, q - 4\))-graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (23)

A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ \(P_3\)-hull number of graphs with diameter two ⋮ Hull number: \(P_5\)-free graphs and reduction rules ⋮ On the geodetic hull number of \(P_{k}\)-free graphs ⋮ And/or-convexity: a graph convexity based on processes and deadlock models ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ Computing the hull number in toll convexity ⋮ On the toll number of a graph ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ The strong convexity spectra of grids ⋮ The geodetic hull number is hard for chordal graphs ⋮ Bounds and algorithms for geodetic hulls ⋮ Convex \(p\)-partitions of bipartite graphs ⋮ Convexity in partial cubes: the hull number ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ The convexity of induced paths of order three and applications: complexity aspects ⋮ The Geodetic Hull Number is Hard for Chordal Graphs ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ The hull number in the convexity of induced paths of order \(3\)

This page was built for publication: On the hull number of some graph classes