On spanning tree packings of highly edge connected graphs
From MaRDI portal
Publication:401495
DOI10.1016/J.JCTB.2013.12.004zbMATH Open1300.05256arXiv1109.6787OpenAlexW2033976647MaRDI QIDQ401495FDOQ401495
Publication date: 27 August 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Abstract: We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a sufficient Hamiltonicity condition for the line graphs of such graphs.
Full work available at URL: https://arxiv.org/abs/1109.6787
Recommendations
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- Packing spanning trees in highly essentially connected graphs
- On the spanning tree packing number of a graph: A survey
- Arboricity and tree-packing in locally finite graphs
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Geodetic topological cycles in locally finite graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Topological paths, cycles and spanning trees in infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- Infinite Hamilton cycles in squares of locally finite graphs
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- Hamilton Cycles in Planar Locally Finite Graphs
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- A Reduction Method for Edge-Connectivity in Graphs
- On infinite cycles. I, II
- Supereulerian graphs: A survey
- Edge-connectivity and edge-disjoint spanning trees
- Reflections on graph theory
- Arboricity and tree-packing in locally finite graphs
- Cycle spaces in topological spaces
- The Cycle Space of an Infinite Graph
- Bicycles and left-right tours in locally finite graphs
- Topological circles and Euler tours in locally finite graphs
- MacLane's planarity criterion for locally finite graphs
- On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting
- Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs
- Cycle decompositions: from graphs to continua
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
Cited In (13)
- Arboricity and tree-packing in locally finite graphs
- Globally balancing spanning trees
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- Extending cycles locally to Hamilton cycles
- A sufficient condition for Hamiltonicity in locally finite graphs
- Cycles through all finite vertex sets in infinite graphs
- On the spanning tree packing number of a graph: A survey
- Hamiltonicity in locally finite graphs: two extensions and a counterexample
- A matroid approach to finding edge connectivity and packing arborescences
- Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
This page was built for publication: On spanning tree packings of highly edge connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401495)
