Axiomatic characterization of transit functions of hierarchies
From MaRDI portal
(Redirected from Publication:3174798)
Recommendations
Cites work
- scientific article; zbMATH DE number 1842910 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 5499517 (Why is no real title available?)
- Axiomatic characterization of the interval function of a graph
- Convexities related to path properties on graphs
- Induced path transit function, monotone and Peano axioms
- Some Elementary Properties of Interval Convexities
- The All-Paths Transit Function of a Graph
- The induced path function, monotonicity and betweenness
- The longest path transit function of a graph and betweenness
- Triangle path transit functions, betweenness and pseudo-modular graphs
Cited in
(7)- Convex geometries yielded by transit functions
- Cut vertex transit functions of hypergraphs
- Transit functions and clustering systems
- Directed transit functions
- Transit functions and pyramid-like binary clustering systems
- On the cut-vertex and the interval transit functions of hypergraphs
- Axiomatic characterization of transit functions of weak hierarchies
This page was built for publication: Axiomatic characterization of transit functions of hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174798)