The hull number of a graph
From MaRDI portal
Publication:1070243
DOI10.1016/0012-365X(85)90174-8zbMath0584.05044MaRDI QIDQ1070243
Martin G. Everett, Stephen B. Seidman
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (55)
A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ \(P_3\)-hull number of graphs with diameter two ⋮ The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree ⋮ On the hull sets and hull number of the Cartesian product of graphs ⋮ 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 ⋮ Complexity of determining the maximum infection time in the geodetic convexity ⋮ On the toll number of a graph ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ The strong convexity spectra of grids ⋮ The geodetic hull number is hard for chordal graphs ⋮ On the Carathéodory number of interval and graph convexities ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ Bounds and algorithms for geodetic hulls ⋮ The maximum infection time in the geodesic and monophonic convexities ⋮ Convexity in partial cubes: the hull number ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes ⋮ On the geodetic and the hull numbers in strong product graphs ⋮ Domination and convexity problems in the target set selection model ⋮ The Geodetic Hull Number is Hard for Chordal Graphs ⋮ Computing the hull number in \(\Delta \)-convexity ⋮ Toll number of the strong product of graphs ⋮ Geodetic spectra of graphs. ⋮ The Carathéodory number of the \(P_3\) convexity of chordal graphs ⋮ The geodetic number of an oriented graph ⋮ Graphs with a minimal number of convex sets ⋮ The geodetic numbers of graphs and digraphs ⋮ Inapproximability results for graph convexity parameters ⋮ On the connectivity and the diameter of betweenness-uniform graphs ⋮ On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs ⋮ Toll convexity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ SOME CENTRALITY RESULTS NEW AND OLD ⋮ On the parameterized complexity of the geodesic hull number ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Betweenness Centrality: Extremal Values and Structural Properties ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ Strong geodetic problem in networks ⋮ On the Carathéodory and exchange numbers of geodetic convexity in graphs ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ The hull number of powers of cycle graphs under restricted conditions ⋮ 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 ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ The hull and geodetic numbers of orientations of graphs ⋮ The forcing hull and forcing geodetic numbers of graphs ⋮ On the Convexity of Paths of Length Two in Undirected Graphs ⋮ On the computation of the hull number of a graph ⋮ THE HULL NUMBER OF POWERS OF CYCLES
Cites Work
This page was built for publication: The hull number of a graph
