Finite Sholander trees, trees, and their betweenness
From MaRDI portal
Publication:641185
DOI10.1016/j.disc.2011.06.011zbMath1235.05029arXiv1101.2957OpenAlexW2054709282MaRDI QIDQ641185
Dieter Rautenbach, Vašek Chvátal, Philipp Matthias Schäfer
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.2957
Related Items (10)
Axiomatic characterization of the interval function of a block graph ⋮ Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Axiomatic characterization of the toll walk function of some graph classes ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ On subbetweennesses of trees: hardness, algorithms, and characterizations ⋮ Axiomatic characterization of the interval function of a bipartite graph ⋮ Axiomatic Characterization of the Interval Function of a Bipartite Graph ⋮ Single peaked domains with tree-shaped spectra ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness
Cites Work
- Unnamed Item
- Unnamed Item
- Axiomatic characterization of the interval function of a graph
- Tree representations of ternary relations
- Sylvester-Gallai theorem and metric betweenness
- Intervals and steps in a connected graph
- The interval function of a connected graph and road systems
- Zur Axiomatik der teilweise geordneten Mengen
- Représentations en arbre de proximités relatives
- Relations related to betweenness: their structure and automorphisms
- Betweenness and Comparability Obtained from Binary Relations
- Trees, Lattices, Order, and Betweenness
- Transitivities of Betweenness
This page was built for publication: Finite Sholander trees, trees, and their betweenness