The following pages link to The hull number of a graph (Q1070243):
Displaying 50 items.
- Hull number: \(P_5\)-free graphs and reduction rules (Q299077) (← links)
- Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) (← links)
- On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- The hull and geodetic numbers of orientations of graphs (Q1025467) (← links)
- The forcing hull and forcing geodetic numbers of graphs (Q1028447) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- Geodetic spectra of graphs. (Q1427436) (← links)
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- Toll number of the strong product of graphs (Q1712528) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- On the hull sets and hull number of the Cartesian product of graphs (Q1886354) (← links)
- The geodetic number of an oriented graph (Q1971800) (← links)
- Toll number of the Cartesian and the lexicographic product of graphs (Q2012538) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- On the toll number of a graph (Q2172405) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- Computing the hull number in \(\Delta \)-convexity (Q2205950) (← links)
- Toll convexity (Q2255809) (← links)
- On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- The strong convexity spectra of grids (Q2409510) (← links)
- The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- The geodetic numbers of graphs and digraphs (Q2461517) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
- (Q2857318) (← links)
- (Q2857327) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- Betweenness Centrality: Extremal Values and Structural Properties (Q3606084) (← links)
- The Geodetic Hull Number is Hard for Chordal Graphs (Q4604645) (← links)
- THE HULL NUMBER OF POWERS OF CYCLES (Q4605408) (← links)
- SOME CENTRALITY RESULTS NEW AND OLD (Q4673905) (← links)
- A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
- The hull number of powers of cycle graphs under restricted conditions (Q5207506) (← links)
- A new notion of convexity in digraphs with an application to Bayesian networks (Q5347248) (← links)
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918409) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918550) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918666) (← links)
