A Helly theorem in weakly modular space
From MaRDI portal
Publication:1126279
DOI10.1016/0012-365X(95)00217-KzbMath0864.05049MaRDI QIDQ1126279
Victor Chepoi, Hans-Jürgen Bandelt
Publication date: 9 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Quasi‐median graphs and algebras, Metrics with finite sets of primitive extensions, Separation of two convex sets in convexity structures, A note on \(r\)-dominating cliques, Finding a central vertex in an HHD-free graph, A classification of the six-point prime metrics, Intervals and steps in a connected graph, Graphs of some CAT(0) complexes, The interval function of a connected graph and road systems, The algebra of metric betweenness. I: Subdirect representation and retraction, The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs, On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays, A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic location problem for graphs
- A Helly theorem for convexity in graphs
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Networks with Condorcet solutions
- Distance-hereditary graphs
- Pseudo-modular graphs
- On local convexity in graphs
- On bridged graphs and cop-win graphs
- Isometric embeddings in Hamming graphs
- Convex sets in graphs. II: Minimal path convexity
- Partition numbers for trees and ordered sets
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- The retracts of Hamming graphs
- Median algebras
- Vertex-to-vertex pursuit in a graph
- Conditions for invariance of set diameters under d-convexification in a graph
- Modular Interval Spaces
- Products of absolute retracts
