2011/09/30 by Florian Lehner, Lehner, Florian
Computer Science · Mathematics · #05C05 #05C63 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C05 #msc:05C63
paper · pdf · doi:10.48550/arxiv.1109.6787
openalex publication_date 2011/09/30 · arxiv created 2013/09/18 · arxiv updated 2013/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.