Cycle-free partial orders and ends of graphs
From MaRDI portal
Recommendations
- Betweenness relations and cycle-free partial orders
- The structure of k-CS-transitive cycle-free partial orders with infinite chains
- The dimension of cycle-free orders
- Construction of some countable 1-arc-transitive bipartite graphs
- Elementary properties of cycle-free partial orders and their automorphism groups
Cites work
- A class of relation types isomorphic to the ordinals
- Automorphism Groups of Infinite Semilinear Orders (I)
- Betweenness relations and cycle-free partial orders
- Construction of some countable 1-arc-transitive bipartite graphs
- Descendants in highly arc transitive digraphs
- Ends of graphs
- Ends of graphs. II
- On \(k\)-CS-transitive cycle-free partial orders with finite alternating chains
- On vertex transitive graphs of infinite degree
- Simple automorphism groups of cycle-free partial orders
- The Reconstruction of Trees from Their Automorphism Groups
- The structure of k-CS-transitive cycle-free partial orders with infinite chains
- Topological groups and infinite graphs
- Vertex-transitive graphs and accessibility
Cited in
(6)- Countable locally 2-arc-transitive bipartite graphs
- Construction of some countable 1-arc-transitive bipartite graphs
- The dimension of cycle-free orders
- \(k\)-CS-transitive infinite graphs
- Construction of some uncountable 2-arc-transitive bipartite graphs
- Elementary properties of cycle-free partial orders and their automorphism groups
This page was built for publication: Cycle-free partial orders and ends of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628710)
