Betweenness in order-theoretic trees
From MaRDI portal
Publication:5049040
Recommendations
Cites work
- Algebraic and logical descriptions of generalized trees
- Antimatroids, betweenness, convexity
- Graph structure and monadic second-order logic. A language-theoretic approach
- Rank-width and vertex-minors
- Regularity equals monadic second-order definability for quasi-trees
- Several notions of rank-width for countable graphs
- Strict order-betweennesses
Cited in
(14)- Induced betweenness in order-theoretic trees
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- On trees and tree dimension of ordered sets
- On limits of betweenness relations
- Axiomatization of betweenness in order-theoretic trees
- Betweenness spaces and tree algebras
- Betweenness of partial orders
- Ordinal properties of tree distances
- scientific article; zbMATH DE number 1827835 (Why is no real title available?)
- scientific article; zbMATH DE number 6473239 (Why is no real title available?)
- Betweenness isomorphisms in the plane -- the case of a circle and points
- scientific article; zbMATH DE number 3917747 (Why is no real title available?)
- Représentations en arbre de proximités relatives
- Strict betweennesses induced by posets as well as by graphs
This page was built for publication: Betweenness in order-theoretic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049040)