Betweenness relations and cycle-free partial orders
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- \(k\)-CS-transitive infinite graphs
- Construction of some uncountable 2-arc-transitive bipartite graphs
- On Ore-type sufficient condition for a bipancyclic ordering
- A characterization of ordered sets and lattices via betweenness relations
- The dimension of cycle-free orders
- Betweenness relations in a categorical setting
- Repetition-freeness with cyclic relations and chain relations
- Cycle-free partial orders and ends of graphs
- Betweenness of partial orders
- The axiomatics of ordered geometry: I. Ordered incidence spaces
- Elementary properties of cycle-free partial orders and their automorphism groups
- On limits of betweenness relations
- On setwise betweenness
- Construction of some countable 1-arc-transitive bipartite graphs
This page was built for publication: Betweenness relations and cycle-free partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875090)