Edge-Colourings and Hamilton Decompostitions of Graphs

Osthus, Deryk (Principal Investigator)
Kuhn, Daniela (Co-Investigator)

Mathematics

9 Article

9 results

Filter

2016
A domination algorithm for {0,1}-instances of the travelling salesman problem
Kühn, D., Osthus, D. & Patel, V., 1 May 2016, In: Random Structures and Algorithms. 48, 3, p. 427-453
Research output: Contribution to journal › Article › peer-review

Open Access
File
2 Citations (Scopus)

264 Downloads (Pure)
Proof of the 1-factorization and Hamilton decomposition conjectures
Csaba, B., Kühn, D., Lo, A., Osthus, D. & Treglown, A., 21 Jun 2016, (E-pub ahead of print) In: Memoirs of the American Mathematical Society. 244, 1154, p. 1-164 164 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
31 Citations (Scopus)

261 Downloads (Pure)
2015
Edge-disjoint hamilton cycles in random graphs
Knox, F., Kühn, D. & Osthus, D., 1 May 2015, In: Random Structures and Algorithms. 46, 3, p. 397-445 49 p.
Research output: Contribution to journal › Article › peer-review
26 Citations (Scopus)
2014
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
Kühn, D. & Osthus, D., 1 Jan 2014, In: Journal of Combinatorial Theory, Series A. 126, 1, p. 128-135 8 p.
Research output: Contribution to journal › Article › peer-review
13 Citations (Scopus)
Hamilton decompositions of regular expanders: Applications
Kühn, D. & Osthus, D., 1 Jan 2014, In: Journal of Combinatorial Theory. Series B. 104, 1, p. 1-27 27 p.
Research output: Contribution to journal › Article › peer-review

File
30 Citations (Scopus)

131 Downloads (Pure)
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Kuhn, D., Lapinskas, J., Osthus, D. & Patel, V., 1 Sept 2014, In: London Mathematical Society. Proceedings . 109, 3, p. 733-762 30 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
11 Citations (Scopus)

279 Downloads (Pure)
2013
Approximate Hamilton decompositions of robustly expanding regular digraphs
Osthus, D. & Staden, K., 2013, In: SIAM Journal on Discrete Mathematics. 27, 3, p. 1372–1409 38 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
5 Citations (Scopus)

242 Downloads (Pure)
Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments
Kuhn, D. & Osthus, D., 1 Apr 2013, In: Advances in Mathematics. 237, p. 62-146 85 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
52 Citations (Scopus)

257 Downloads (Pure)
2012

Edge-disjoint Hamilton cycles in graphs
Christofides, D., Kuhn, D. & Osthus, D., 1 Oct 2012, In: Journal of Combinatorial Theory. Series B. 102, p. 1035-1060 26 p.
Research output: Contribution to journal › Article › peer-review

18 Citations (Scopus)

Edge-Colourings and Hamilton Decompostitions of Graphs

Research output

Search results