Research output per year
Research output per year
Project Details
| Short title | Edge-Colourings and Hamilton Decompostitions of Graphs |
|---|---|
| Status | Finished |
| Effective start/end date | 1/06/12 → 30/09/14 |
Funding
- Engineering & Physical Science Research Council
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
Research output
- 9 Article
-
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-453Research output: Contribution to journal › Article › peer-review
Open AccessFile2 Citations (Scopus)348 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 AccessFile31 Citations (Scopus)303 Downloads (Pure) -
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)