Pages that link to "Item:Q897965"
From MaRDI portal
The following pages link to Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965):
Displayed 11 items.
- On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs'' (Q1680540) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- A general framework for path convexities (Q2156285) (← 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)
- Deadlock resolution in wait-for graphs by vertex/arc deletion (Q2420655) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms (Q5859672) (← links)
- Efficient realizations of closure systems (Q6193266) (← links)