On the Hull Number of Triangle-Free Graphs
From MaRDI portal
Publication:3058552
DOI10.1137/090751797zbMath1207.05044OpenAlexW1992365905MaRDI QIDQ3058552
Dieter Rautenbach, Fábio Protti, Mitre C. Dourado, Jayme Luiz Szwarcfiter
Publication date: 3 December 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6caedae5b3597ac9151c2e4af78c349ef78fdeeb
Related Items
\(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 ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ The geodetic hull number is hard for chordal graphs ⋮ On the Carathéodory number of interval and graph convexities ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ Convexity in partial cubes: the hull number ⋮ The Geodetic Hull Number is Hard for Chordal Graphs ⋮ The Carathéodory number of the \(P_3\) convexity of chordal graphs ⋮ Graphs with a minimal number of convex sets ⋮ Inapproximability results for graph convexity parameters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the parameterized complexity of the geodesic hull number ⋮ Complexity results related to monophonic convexity ⋮ 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 ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
