A Helly theorem for geodesic convexity in strongly dismantlable graphs

DOI10.1016/0012-365X(93)E0178-7zbMath0828.05062MaRDI QIDQ1893169

Norbert Polat

Publication date: 3 July 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

clique numberHelly numbergeodesic convexityHelly theoremstrongly dismantlable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Helly-type theorems and geometric transversal theory (52A35)

Related Items

Stable graphs for a family of endomorphisms ⋮ Helly theorems for 3-Steiner and 3-monophonic convexity in graphs ⋮ Gibbs measures and dismantlable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A Helly theorem for convexity in graphs
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• On bridged graphs and cop-win graphs
• Convex sets in graphs. II: Minimal path convexity
• Finite invariant simplices in infinite graphs
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• Graphs with intrinsic s3 convexities
• Retract‐collapsible graphs and invariant subgraph properties