On spanning trees and \(k\)-connectedness in infinite graphs

DOI10.1016/0095-8956(92)90022-PzbMath0780.05013MaRDI QIDQ1204461

Reinhard Diestel

Publication date: 10 March 1993

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

zbMATH Keywords

spanning treeinfinite graphconnected graphfactorsendtree-decomposition\(k\)-connectednessend-faithful

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (7)

Topological paths, cycles and spanning trees in infinite graphs ⋮ Topological cycle matroids of infinite graphs ⋮ The structure of rayless graphs ⋮ The end structure of a graph: Recent results and open problems ⋮ A proof of the bounded graph conjecture ⋮ A note on \(k\)-connected rayless graphs ⋮ On graphs with a metric end space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Bounded graphs
• An end-faithful spanning tree counterexample
• Infinite connected graphs with no end-preserving spanning trees
• The end structure of a graph: Recent results and open problems
• Über unendliche Wege in Graphen
• On end-faithful spanning trees in infinite graphs

This page was built for publication: On spanning trees and \(k\)-connectedness in infinite graphs