On end-faithful spanning trees in infinite graphs

DOI10.1017/S0305004100068742zbMath0714.05020OpenAlexW2106828795MaRDI QIDQ3199431

Reinhard Diestel

Publication date: 1990

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

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

zbMATH Keywords

end-faithful spanning tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Simplicial decompositions of graphs: A survey of applications, End-faithful forests and spanning trees in infinite graphs, The end structure of a graph: Recent results and open problems, On spanning trees and \(k\)-connectedness in infinite graphs

Cites Work

• Unnamed Item
• The action of nilpotent groups on infinite graphs
• Infinite paths that contain only shortest paths
• Über unendliche Wege in Graphen
• Simplicial Decompositions of Infinite Graphs
• Wurzelbäume und unendliche Wege in Graphen