On the hull number of some graph classes
DOI10.1016/J.TCS.2012.12.035zbMATH Open1419.05049OpenAlexW2036683504MaRDI QIDQ1939271FDOQ1939271
Authors: Nicolas Nisse, R. Soares, Júlio Araújo, Victor Campos, F. Giroire, L. Sampaio 
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
Recommendations
- On the hull number of some graph classes
- On the computation of the hull number of a graph
- The hull number of a graph
- On the hull number of triangle-free graphs
- scientific article; zbMATH DE number 2192211
- On the Hajós number of graphs
- On the hull number of a graph.
- Hull numbers of path convexities on graphs
- On the hull sets and hull number of the Cartesian product of graphs
- ON THE DETOUR AND VERTEX DETOUR HULL NUMBERS OF A GRAPH
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Paths and cycles (05C38)
Cited In (47)
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- The geodetic hull number is hard for chordal graphs
- Injective hulls of various graph classes
- On the hull number of a graph.
- Convexity in partial cubes: the hull number
- Hull and geodetic numbers for some classes of oriented graphs
- Hull and geodetic numbers for some classes of oriented graphs
- Hull number: \(P_5\)-free graphs and reduction rules
- And/or-convexity: a graph convexity based on processes and deadlock models
- On the Hajós number of graphs
- Convexity in partial cubes: the hull number
- On the computation of the hull number of a graph
- Computing the hull number in \(\Delta \)-convexity
- Geodetic number versus hull number in \(P_3\)-convexity
- Hull numbers of path convexities on graphs
- Geodetic convexity parameters for \((q, q - 4)\)-graphs
- \(P_3\)-hull number of graphs with diameter two
- Computing metric hulls in graphs
- Bounds and algorithms for geodetic hulls
- Title not available (Why is that?)
- The hull number of a graph
- On the hull number on cycle convexity of graphs
- Computing the hull number in toll convexity
- On the geodetic hull number of \(P_{k}\)-free graphs
- On interval number in cycle convexity
- A polynomial time algorithm for geodetic hull number for complementary prisms
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
- On the geodetic rank of a graph
- On the hull number of triangle-free graphs
- Title not available (Why is that?)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- On the toll number of a graph
- Geodetic convexity parameters for graphs with few short induced paths
- Two classes of graphs in which some problems related to convexity are efficiently solvable
- The geodetic hull number is hard for chordal graphs
- Immediate versus eventual conversion: comparing geodetic and hull numbers in \(P _{3}\)-convexity
- On the parameterized complexity of the geodesic hull number
- On the geodetic hull number for complementary prisms. II.
- The strong convexity spectra of grids
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- The hull number in the convexity of induced paths of order \(3\)
- The convexity of induced paths of order three and applications: complexity aspects
- Convex \(p\)-partitions of bipartite graphs
- On monophonic position sets in graphs
- Computing the hull and interval numbers in the weakly toll convexity
- ON THE DETOUR AND VERTEX DETOUR HULL NUMBERS OF A GRAPH
This page was built for publication: On the hull number of some graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939271)
