Geodetic Number versus Hull Number in $P_3$-Convexity
From MaRDI portal
Publication:2848533
DOI10.1137/110859014zbMath1272.05148OpenAlexW2050574881MaRDI QIDQ2848533
Dieter Rautenbach, Carmen C. Centeno, Vinícius Gusmão 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
Other problems of combinatorial convexity (52A37) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
\(P_3\)-hull number of graphs with diameter two, 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 \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products, Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs, \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers, Strong geodetic problem on Cartesian products of graphs, On the \(P_3\)-hull number of Hamming graphs, Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs, Convexity in partial cubes: the hull number, Efficient realizations of closure systems, Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees, On the \(P_3\)-hull number of Kneser graphs, On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs