Infinite connected graphs with no end-preserving spanning trees

DOI10.1016/0095-8956(92)90059-7zbMath0753.05030OpenAlexW2022502417MaRDI QIDQ1193567

Carsten Thomassen

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90059-7

zbMATH Keywords

spanning treeinfinite connectivityinfinite connected graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (10)

Topological paths, cycles and spanning trees in infinite graphs ⋮ Edge-ends in countable graphs ⋮ Duality theorems for stars and combs III: Undominated combs ⋮ Constructing tree-decompositions that display all topological ends ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ The end structure of a graph: Recent results and open problems ⋮ On spanning trees and \(k\)-connectedness in infinite graphs ⋮ End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays ⋮ Multi-Faithful Spanning Trees of Infinite Graphs ⋮ Spanning trees of countable graphs omitting sets of dominated ends

Cites Work

• Aspects topologiques de la séparation dans les graphes infinis. I. II
• Über unendliche Wege in Graphen
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinite connected graphs with no end-preserving spanning trees