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

2014/11/21 by Brian Alspach, Darryn Bryant, Alspach, Brian +7
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1411.6047

arxiv created 2014/11/21 · arxiv updated 2014/11/25

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.

Related

• A complete solution to the infinite Oberwolfach problem
• A constructive solution to the Oberwolfach Problem with a large cycle
• The generalised Oberwolfach problem
• A survey on constructive methods for the Oberwolfach problem and its variants
• Cyclic uniform 2-factorizations of the complete multipartite graph