On spanning tree packings of highly edge connected graphs

DOI10.1016/j.jctb.2013.12.004zbMath1300.05256arXiv1109.6787MaRDI QIDQ401495

Florian Lehner

Publication date: 27 August 2014

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

Full work available at URL: https://arxiv.org/abs/1109.6787

zbMATH Keywords

Hamiltonian cycle; end faithful spanning tree; infinite graph theory; spanning tree packing

Mathematics Subject Classification ID

05C05: Trees

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

05C45: Eulerian and Hamiltonian graphs

05C63: Infinite graphs