Arboricity and tree-packing in locally finite graphs

DOI10.1016/j.jctb.2005.08.003zbMath1085.05052OpenAlexW2151563460MaRDI QIDQ2490258

Maya Jakobine Stein

Publication date: 28 April 2006

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.2005.08.003

zbMATH Keywords

Freudenthal compactificationconjecture of Diestel

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Topological cycle matroids of infinite graphs ⋮ On spanning tree packings of highly edge connected graphs ⋮ The fundamental group of a locally finite graph with ends ⋮ The homology of a locally finite graph with ends ⋮ An analogue of Edmonds' branching theorem for infinite digraphs ⋮ Connected but not path-connected subspaces of infinite graphs ⋮ On the homology of locally compact spaces with ends ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Extremal infinite graph theory ⋮ Infinite graphic matroids ⋮ Globally balancing spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• On infinite cycles. I, II
• On a packing problem for infinite graphs and independence spaces
• Topological paths, cycles and spanning trees in infinite graphs
• On end degrees and infinite cycles in locally finite graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The Cycle Space of an Infinite Graph
• Infinite graphs—A survey
• Decomposition of Finite Graphs Into Forests