The following pages link to (Q5396751):
Displayed 14 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- A general framework for path convexities (Q2156285) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- (Q2857327) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)