Spanning trees of locally finite graphs
From MaRDI portal
Publication:3835472
Recommendations
Cites work
Cited in
(21)- An end-faithful spanning tree counterexample
- Ends in spanning trees
- Spanning trees of countable graphs omitting sets of dominated ends
- On exponential trees
- The local limit of the uniform spanning tree on dense graphs
- Spanning trees in hyperbolic graphs
- Topological paths, cycles and spanning trees in infinite graphs
- Ends and multi-endings. II
- One-ended spanning trees in amenable unimodular graphs
- Ends in free minimal spanning forests
- There are uncountably many topological types of locally finite trees
- Multi-Faithful Spanning Trees of Infinite Graphs
- scientific article; zbMATH DE number 3924821 (Why is no real title available?)
- scientific article; zbMATH DE number 15462 (Why is no real title available?)
- Ends of graphs
- scientific article; zbMATH DE number 4123753 (Why is no real title available?)
- scientific article; zbMATH DE number 561828 (Why is no real title available?)
- Algebraic approach to locally finite trees with one end
- Infinite paths in locally finite graphs and in their spanning trees
- A local injective proof of log-concavity for increasing spanning forests
- A decomposition of locally finite graphs
This page was built for publication: Spanning trees of locally finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835472)