On spanning tree packings of highly edge connected graphs

Details On spanning tree packings of highly edge connected graphs On spanning tree packings of highly edge connected graphs

2011-09-30

arxiv.org/abs/1109.6787v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On spanning tree packings of highly edge connected graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On spanning tree packings of highly edge connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On spanning tree packings of highly edge connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-668297