Optimal packings of Hamilton cycles in graphs of high minimum degree

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

11 Citations (Scopus)

Original language	English
Pages (from-to)	394-416
Number of pages	23
Journal	Combinatorics, Probability and Computing
Volume	22
Publication status	Published - 2013

Cite this

@article{5f0b8d428ad24de8af846796afc3c3a6,

title = "Optimal packings of Hamilton cycles in graphs of high minimum degree",

author = "Daniela Kuhn and John Lapinskas and Deryk Osthus",

year = "2013",

language = "English",

volume = "22",

pages = "394--416",

journal = "Combinatorics, Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - Optimal packings of Hamilton cycles in graphs of high minimum degree

AU - Kuhn, Daniela

AU - Lapinskas, John

AU - Osthus, Deryk

PY - 2013

Y1 - 2013

UR - https://www.scopus.com/pages/publications/84879898173

M3 - Article

SN - 0963-5483

VL - 22

SP - 394

EP - 416

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

ER -