Pages that link to "Item:Q799698"
From MaRDI portal
The following pages link to A Helly theorem for convexity in graphs (Q799698):
Displaying 14 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (Q534056) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Centers of triangulated graphs (Q912134) (← links)
- Turán theorems and convexity invariants for directed graphs (Q941398) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- On local convexity in graphs (Q1089354) (← links)
- Convex sets in graphs. II: Minimal path convexity (Q1120125) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- Some properties of graph centroids (Q1179740) (← links)
- A Helly theorem for geodesic convexity in strongly dismantlable graphs (Q1893169) (← links)
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
- Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232) (← links)
