On spanning tree packings of highly edge connected graphs.

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)93-126
JournalJournal of combinatorial theory / B
Volume105
DOIs
Publication statusPublished - 2014

Fields of Expertise

  • Sonstiges

Cite this

On spanning tree packings of highly edge connected graphs. / Lehner, Florian.

In: Journal of combinatorial theory / B, Vol. 105, 2014, p. 93-126.

Research output: Contribution to journalArticleResearchpeer-review

@article{4aa962a13ba74cc7b7b2be088564f356,
title = "On spanning tree packings of highly edge connected graphs.",
author = "Florian Lehner",
year = "2014",
doi = "doi:10.1016/j.jctb.2013.12.004",
language = "English",
volume = "105",
pages = "93--126",
journal = "Journal of combinatorial theory / B",
issn = "0095-8956",
publisher = "Academic Press",

}

TY - JOUR

T1 - On spanning tree packings of highly edge connected graphs.

AU - Lehner, Florian

PY - 2014

Y1 - 2014

U2 - doi:10.1016/j.jctb.2013.12.004

DO - doi:10.1016/j.jctb.2013.12.004

M3 - Article

VL - 105

SP - 93

EP - 126

JO - Journal of combinatorial theory / B

JF - Journal of combinatorial theory / B

SN - 0095-8956

ER -