Construction of some uncountable 2-arc-transitive bipartite graphs

DOI10.1007/s11083-008-9098-0zbMath1158.05056OpenAlexW2142989145MaRDI QIDQ1013993

Manfred Droste, John K. Truss, Robert D. Gray

Publication date: 24 April 2009

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-008-9098-0

zbMATH Keywords

cycle-freearc-transitivitypartial-order

Mathematics Subject Classification ID

Partial orders, general (06A06) Structural characterization of families of graphs (05C75)

Related Items (2)

Countable locally 2-arc-transitive bipartite graphs ⋮ Construction of some countable 1-arc-transitive bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Construction of some countable 1-arc-transitive bipartite graphs
• Extending partial isomorphisms of graphs
• On \(k\)-CS-transitive cycle-free partial orders with finite alternating chains
• Infinite homogeneous bipartite graphs with unequal sides
• Cycle-free partial orders and ends of graphs
• Structure of partially ordered sets with transitive automorphism groups
• The structure of k-CS-transitive cycle-free partial orders with infinite chains
• The structure of 𝑘-CS-transitive cycle-free partial orders
• Analysing finite locally 𝑠-arc transitive graphs
• Homogeneous Families and their Automorphism Groups
• Betweenness relations and cycle-free partial orders

This page was built for publication: Construction of some uncountable 2-arc-transitive bipartite graphs