On spanning tree packings of highly edge connected graphs
Combinatorics
2013-09-19 v4
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.
Keywords
Cite
@article{arxiv.1109.6787,
title = {On spanning tree packings of highly edge connected graphs},
author = {Florian Lehner},
journal= {arXiv preprint arXiv:1109.6787},
year = {2013}
}