On spanning tree packings of highly edge connected graphs

Florian Lehner

doi:10.1016/j.jctb.2013.12.004

On spanning tree packings of highly edge connected graphs

Florian Lehner

Institute of Geometry (5070)

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	93-126
Journal	Journal of Combinatorial Theory, Series B
Volume	105
DOIs	https://doi.org/10.1016/j.jctb.2013.12.004
Publication status	Published - 2014

Fields of Expertise

Sonstiges

Access to Document

10.1016/j.jctb.2013.12.004Licence: Other

Cite this

@article{4aa962a13ba74cc7b7b2be088564f356,

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.",

author = "Florian Lehner",

year = "2014",

doi = "10.1016/j.jctb.2013.12.004",

language = "English",

volume = "105",

pages = "93--126",

journal = "Journal of Combinatorial Theory, Series B",

issn = "1096-0902",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - On spanning tree packings of highly edge connected graphs

AU - Lehner, Florian

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

U2 - 10.1016/j.jctb.2013.12.004

DO - 10.1016/j.jctb.2013.12.004

M3 - Article

SN - 1096-0902

VL - 105

SP - 93

EP - 126

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

ER -

On spanning tree packings of highly edge connected graphs

Abstract

Fields of Expertise

Access to Document

Fingerprint

Cite this