Transitivity conditions in infinite graphs
DOI10.1007/S00493-012-2694-ZzbMATH Open1299.05157arXiv0910.5651OpenAlexW1975262462MaRDI QIDQ2250834FDOQ2250834
Authors: Matthias Hamann, Julian Pott
Publication date: 21 July 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.5651
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)
Cites Work
- Homogeneous graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite distance transitive graphs of finite valency
- Vertex cuts
- Combinatorially homogeneous graphs
- On Homogeneous Graphs
- Vertex-transitive graphs and accessibility
- Title not available (Why is that?)
- End compactifications in non-locally-finite graphs
- Title not available (Why is that?)
- Countable connected-homogeneous graphs
- Metric ends, fibers and automorphisms of graphs
- \(k\)-CS-transitive infinite graphs
- Distance-transitivity in infinite graphs
- Accessibility and ends of graphs
Cited In (8)
- Translations and semi-translations in infinite graphs
- Group actions on metric spaces: fixed points and free subgroups
- Vertex cuts
- \(k\)-CS-transitive infinite graphs
- The classification of connected-homogeneous digraphs with more than one end
- The classification of finite and locally finite connected-homogeneous digraphs
- Infinite Vertex-Transitive, Edge-Transitive Non-1-Transitive Graphs
- Sharply \(k\)-arc-transitive-digraphs: finite and infinite examples
This page was built for publication: Transitivity conditions in infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250834)