Geodetic number versus hull number in P₃-convexity
From MaRDI portal
Publication:2848533
DOI10.1137/110859014zbMATH Open1272.05148OpenAlexW2050574881MaRDI QIDQ2848533FDOQ2848533
Authors: C. C. Centeno, Dieter Rautenbach, V. G. Pereira de Sá, Lucia Draque Penso
Publication date: 26 September 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110859014
Recommendations
- Immediate versus eventual conversion: comparing geodetic and hull numbers in \(P _{3}\)-convexity
- On the hull number of a graph.
- On the hull number of some graph classes
- On \(P_{3}\)-convexity of graphs with bounded degree
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other problems of combinatorial convexity (52A37)
Cited In (19)
- Convexity in partial cubes: the hull number
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
- On the \(P_3\)-hull number of some products of graphs
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs
- On the \(P_3\)-hull number of Kneser graphs
- On the geodesic pre-hull number of a graph
- \(P_3\)-hull number of graphs with diameter two
- On the \(P_3\)-hull number of Hamming graphs
- Strong geodetic problem on Cartesian products of graphs
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products
- Efficient realizations of closure systems
- On the geodetic hull number of \(P_{k}\)-free graphs
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- On \(P_{3}\)-convexity of graphs with bounded degree
- Immediate versus eventual conversion: comparing geodetic and hull numbers in \(P _{3}\)-convexity
- Bootstrap percolation in strong products of graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
This page was built for publication: Geodetic number versus hull number in \(P_3\)-convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848533)