The classification of connected-homogeneous digraphs with more than one end
From MaRDI portal
Publication:4915344
DOI10.1090/S0002-9947-2012-05666-2zbMath1262.05071arXiv1004.5273MaRDI QIDQ4915344
Fabian Hundertmark, Matthias Hamann
Publication date: 10 April 2013
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.5273
05C75: Structural characterization of families of graphs
05C20: Directed graphs (digraphs), tournaments
05C63: Infinite graphs
Related Items
The classification of finite and locally finite connected-homogeneous digraphs, Local 2-separators, Connected-Homomorphism-Homogeneous Graphs, Vertex Cuts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On vertex transitive graphs of infinite degree
- Highly arc transitive digraphs: reachability, topological groups
- Countable connected-homogeneous graphs
- Homogeneous tournaments revisited
- Combinatorially homogeneous graphs
- Infinite distance transitive graphs of finite valency
- Homogeneous graphs
- Homogeneity conditions in graphs
- Infinite highly arc transitive digraphs and universal covering digraphs
- Distance-transitivity in infinite graphs
- Vertex-transitive graphs and accessibility
- End-transitive graphs
- Cutting up graphs
- Highly arc-transitive digraphs with no homomorphism onto \(\mathbb Z\)
- Infinite homogeneous bipartite graphs with unequal sides
- Accessibility and ends of graphs
- Locally finite homogeneous graphs
- Transitivity conditions in infinite graphs
- Locally-finite connected-homogeneous digraphs
- Transitive digraphs with more than one end
- Cutting up graphs revisited – a short proof of Stallings' structure theorem
- Countable Ultrahomogeneous Undirected Graphs
- On Homogeneous Graphs
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- Countable Homogeneous Tournaments
