examine decompositions of some low degree circulant graphs into cycles, into paths, ... Strong results on the path decomposition problem for complete graphs ...

Bryant, Darryn and Martin, Geoffrey (2009). Some results on decompositions of low degree circulant graphs. Australasian Journal of Combinatorics 45 251-261.

The circulant graph of order n with connection set S is denoted by Circ(n,S). Several results on decompositions of Circ(n,{1,2}) and Circ(n,{1,2,3}) are ...

Mar 11, 2020 · Darryn E. Bryant, Geoffrey Martin: Some results on decompositions of low degree circulant graphs. Australas. J Comb. 45: 251-262 (2009).

This paper introduces the edge decomposition of circulant graphs with 2n vertices by different graph classes.

It is known that if an almost bipartite graph G with n edges possesses a γ- labeling, then the complete graph K2nx+1 admits a cyclic G-decomposition.

Various results on factorisations of complete graphs into circulant graphs ... Martin, Some results on decompositions of low degree circulant graphs, Australas.

Bryant, Some results on decompositions of low degree circulant graphs, Australas. J. Combin., № 45, с. 251; Bunge, On the cyclic decomposition of circulant ...

May 12, 2024 · This paper introduces the edge decomposition of circulant graphs with 2n vertices by different graph classes. These circulant graphs are denoted ...

Dec 22, 2017 · Martin, Some results on decompositions of low degree circulant graphs, Australas. J. Combin. 45 (2009), 251– 261. 6S. Capparelli and A. Del ...