Projects per year
Abstract
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Original language | English |
---|---|
Pages (from-to) | 79–106 |
Number of pages | 28 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 129 |
DOIs | |
Publication status | Published - Mar 2018 |
Keywords
- Complete multigraph
- Cycle decomposition
- Edge decomposition
Projects
- 3 Finished
-
Matchings in Combinatorial Structures
Wanless, I. (Primary Chief Investigator (PCI)), Bryant, D. (Chief Investigator (CI)) & Horsley, D. (Chief Investigator (CI))
Australian Research Council (ARC), Monash University, University of Queensland , University of Melbourne
1/01/15 → 10/10/20
Project: Research
-
Partitioning and ordering Steiner triple systems
Horsley, D. (Primary Chief Investigator (PCI))
Australian Research Council (ARC)
1/03/12 → 31/12/17
Project: Research
-
A new approach to compressed sensing
Horsley, D. (Primary Chief Investigator (PCI)), Bryant, D. (Chief Investigator (CI)) & Colbourn, C. (Partner Investigator (PI))
Australian Research Council (ARC)
1/01/12 → 31/12/14
Project: Research