On the Hull Number of Triangle-Free Graphs

DOI10.1137/090751797zbMATH Open1207.05044OpenAlexW1992365905MaRDI QIDQ3058552FDOQ3058552

Dieter Rautenbach, Fábio Protti, Jayme L. Szwarcfiter, Mitre C. Dourado

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

zbMATH Keywords

graphconvex hullconvex sethull numbergeodetic number

Mathematics Subject Classification ID

Distance in graphs (05C12) Other problems of combinatorial convexity (52A37)

Cited In (25)

• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
• The geodetic hull number is hard for chordal graphs
• The Geodetic Hull Number is Hard for Chordal Graphs
• On the Carathéodory number of interval and graph convexities
• Convexity in partial cubes: the hull number
• The Carathéodory number of the \(P_3\) convexity of chordal graphs
• Hull number: \(P_5\)-free graphs and reduction rules
• On the \(P_3\)-hull number of some products of graphs
• Graphs with a minimal number of convex sets
• Complexity results related to monophonic convexity
• Geodetic convexity parameters for \((q, q - 4)\)-graphs
• Counting \(H\)-free graphs
• \(P_3\)-hull number of graphs with diameter two
• On the \(P_3\)-hull number of Hamming graphs
• On the geodetic hull number of \(P_{k}\)-free graphs
• On the Carathéodory number for the convexity of paths of order three
• 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
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
• On the hull number of some graph classes
• On the hull number of some graph classes
• Inapproximability results for graph convexity parameters
• On the parameterized complexity of the geodesic hull number
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
• Geodetic Convexity Parameters for Graphs with Few Short Induced Paths

This page was built for publication: On the Hull Number of Triangle-Free Graphs

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