The following pages link to The hull number of a graph (Q1070243):
Displaying 11 items.
- 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)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918774) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes (Q6166039) (← links)
- On the connectivity and the diameter of betweenness-uniform graphs (Q6184309) (← links)
