Paper Info
Title
On spanning tree packings of highly edge connected graphs
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.
Year
DOI
Venue
2014
10.1016/j.jctb.2013.12.004
J. Comb. Theory, Ser. B
Keywords
Field
DocType
line graph,similar result,tree packing theorem,tree packing,certain infinite graph,end faithful,finite graph,sufficient hamiltonicity condition,connected graph,spanning tree
Discrete mathematics,Combinatorics,Indifference graph,Trémaux tree,Tree-depth,Chordal graph,Spanning tree,Pathwidth,1-planar graph,Mathematics,Minimum spanning tree
Journal
Volume
ISSN
Citations 
105,
0095-8956
5
PageRank 
References 
Authors
0.52
15
1
Name
Order
Citations
PageRank
Florian Lehner1217.24