Betweenness in order-theoretic trees
From MaRDI portal
Publication:5049040
DOI10.1007/978-3-030-48006-6_6OpenAlexW3027991697MaRDI QIDQ5049040FDOQ5049040
Authors: Bruno Courcelle
Publication date: 9 November 2022
Published in: Fields of Logic and Computation III (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-48006-6_6
Recommendations
Cites Work
- Graph structure and monadic second-order logic. A language-theoretic approach
- Rank-width and vertex-minors
- Several notions of rank-width for countable graphs
- Strict order-betweennesses
- Antimatroids, betweenness, convexity
- Algebraic and logical descriptions of generalized trees
- Regularity equals monadic second-order definability for quasi-trees
Cited In (14)
- Strict betweennesses induced by posets as well as by graphs
- On limits of betweenness relations
- Représentations en arbre de proximités relatives
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ordinal properties of tree distances
- Betweenness spaces and tree algebras
- Betweenness of partial orders
- On trees and tree dimension of ordered sets
- Betweenness isomorphisms in the plane -- the case of a circle and points
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- Title not available (Why is that?)
- Axiomatization of betweenness in order-theoretic trees
- Induced betweenness in order-theoretic trees
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)