$n$-Isofactorizations of $8$-Regular Circulant Graphs

Abstract

We investigate the problem of decomposing the edges of a connected circulant graph with $n$ vertices and generating set $S$ into isomorphic subgraphs, each having $n$ edges. For $8$-regular circulants, we show that this is always possible when $s+2\le \frac{n}{4}$ for all edge lengths $s\in S$.