On factorisations of complete graphs into circulant graphs and the Oberwolfach problem

Authors

  • Brian Alspach University of Newcastle, Australia
  • Darryn Bryant The University of Queensland, Australia
  • Daniel Horsley Monash University, Australia
  • Barbara Maenhaut The University of Queensland, Australia
  • Victor Scharaschkin The University of Queensland, Australia

DOI:

https://doi.org/10.26493/1855-3974.770.150

Keywords:

Oberwolfach problem, graph factorisations, graph decompositions, 2-factorisations

Abstract

Various results on factorisations of complete graphs into circulant graphs and on 2-factorisations of these circulant graphs are proved. As a consequence, a number of new results on the Oberwolfach Problem are obtained. For example, a complete solution to the Oberwolfach Problem is given for every 2-regular graph of order 2p where p ≡ 5 (mod 8) is prime.

Downloads

Published

2015-10-03

Issue

Vol. 11 No. 1 (2016)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/