Quasi-isometries between graphs and trees

DOI10.1016/j.jctb.2007.06.008zbMath1205.05071MaRDI QIDQ947727

Rögnvaldur G. Möller, Bernhard Krön

Publication date: 7 October 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.06.008

zbMATH Keywords

tree; quasi-isometry; quasi-geodesic; ends of graphs; d-fiber

Mathematics Subject Classification ID

05C05: Trees

05C38: Paths and cycles

05B25: Combinatorial aspects of finite geometries

05C12: Distance in graphs

05C07: Vertex degrees

Related Items

Two-ended quasi-transitive graphs, Minor exclusion in quasi-transitive graphs, Group actions on metric spaces: fixed points and free subgroups, Spanning trees in hyperbolic graphs, Analogues of Cayley graphs for topological groups, Surviving ends in Bernoulli percolation on graphs roughly isometric to a tree, A Stallings type theorem for quasi-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and groups with tree-like properties
• The Hadwiger number of infinite vertex-transitive graphs
• Vertex-transitive graphs and accessibility
• Graph-theoretical versus topological ends of graphs.
• On translations of double rays in graphs
• Über unendliche Wege in Graphen
• Vertex-transitive graphs
• Automorphisms and endomorphisms of infinite locally finite graphs
• Über die Enden diskreter Räume und Gruppen
• Decomposing Ends of Locally Finite Graphs
• Metric ends, fibers and automorphisms of graphs
• Quasi-isometries between non-locally-finite graphs and structure trees