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

DOI10.26493/1855-3974.770.150zbMath1351.05177arXiv1411.6047OpenAlexW1861483862WikidataQ129366679 ScholiaQ129366679MaRDI QIDQ2835398

Darryn E. Bryant, Brian Alspach, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin

Publication date: 2 December 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6047

zbMATH Keywords

graph decompositionsOberwolfach problem2-factorisationsgraph factorisations

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Related Items (4)

On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Unnamed Item

This page was built for publication: On factorisations of complete graphs into circulant graphs and the Oberwolfach problem