Some Elementary Properties of Interval Convexities
From MaRDI portal
Cited in
(27)- Combinatorial geometry
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Convex sets in graphs. II: Minimal path convexity
- Beziehungen zwischen den Sätzen von Radon, Helly und Caratheodory bei axiomatischen Konvexitäten
- The maximum time of 2-neighbor bootstrap percolation: complexity results
- Convexities related to path properties on graphs
- Multilevel clustering models and interval convexities
- Intersecting sets in midset spaces. I
- Induced path transit function, monotone and Peano axioms
- On the \(P_3\)-hull number of Kneser graphs
- On the P₃-hull number of Hamming graphs
- Toll convexity
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
- Intervals and convex sets in strong product of graphs
- Radon numbers grow linearly
- The All-Paths Transit Function of a Graph
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
- Antimatroids, betweenness, convexity
- Axiomatic characterization of transit functions of hierarchies
- On the Carathéodory number of interval and graph convexities
- Maximal closed set and half-space separations in finite closure systems
- Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes
- An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
- First-order logic axiomatization of metric graph theory
- Convex geometries yielded by transit functions
- On the hull and interval numbers of oriented graphs
- The induced path function, monotonicity and betweenness
This page was built for publication: Some Elementary Properties of Interval Convexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5635959)
