Pages that link to "Item:Q1727735"
From MaRDI portal
The following pages link to Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735):
Displaying 7 items.
- On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- (Q4297643) (← links)
- Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes (Q6166039) (← links)
