Pages that link to "Item:Q510982"
From MaRDI portal
The following pages link to On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982):
Displaying 9 items.
- 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}\)-factorization of triangulated Cartesian product of complete graph of odd order (Q1683589) (← links)
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- \(P_3\)-factorization of Cartesian product of complete graphs (Q2918403) (← links)
- (Q4405761) (← links)
- P<sub>3</sub>-factorization of triangulated Cartesian product of complete graphs (Q5245849) (← links)