Cycle-free partial orders and ends of graphs

DOI10.1017/S0305004108002120zbMath1216.05063OpenAlexW2168043294MaRDI QIDQ3628710

Robert D. Gray, John K. Truss

Publication date: 20 May 2009

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004108002120

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38)

Related Items (3)

Countable locally 2-arc-transitive bipartite graphs ⋮ \(k\)-CS-transitive infinite graphs ⋮ Construction of some uncountable 2-arc-transitive bipartite graphs

Cites Work

• On vertex transitive graphs of infinite degree
• Construction of some countable 1-arc-transitive bipartite graphs
• Topological groups and infinite graphs
• On \(k\)-CS-transitive cycle-free partial orders with finite alternating chains
• Vertex-transitive graphs and accessibility
• Descendants in highly arc transitive digraphs
• A class of relation types isomorphic to the ordinals
• Automorphism Groups of Infinite Semilinear Orders (I)
• Ends of graphs
• Ends of graphs. II
• The structure of k-CS-transitive cycle-free partial orders with infinite chains
• Simple automorphism groups of cycle-free partial orders
• The Reconstruction of Trees from Their Automorphism Groups
• Betweenness relations and cycle-free partial orders

This page was built for publication: Cycle-free partial orders and ends of graphs