1 |
J. R. Cho, M. J. Ferrara, R. J. Gould, and J. R. Schmitt, Difference sets generating gregarious 4-cycle decomposition of complete multipartite graphs. Preprint
|
2 |
M. Sajna, On decomposing I into cycles of a fixed odd length, Discrete Math. 244 (2002), no. 1-3, 435-444
DOI
ScienceOn
|
3 |
D. Sotteau, Decomposition of () into cycles (circuits) of length 2, J. Combin. Theory Ser. B 30 (1981), no. 1, 75-81
DOI
|
4 |
B. Alspach and H. Gavlas, Cycle decompositions of and − I, J. Combin. Theory Ser. B 81 (2001), no. 1, 77-99
DOI
ScienceOn
|
5 |
E. Billington and D. G. Hoffman, Decomposition of complete tripartite graphs into gregarious 4-cycles, Discrete Math. 261 (2003), no. 1-3, 87-111
DOI
ScienceOn
|
6 |
M. Sajna, Cycle decompositions. III. Complete graphs and fixed length cycles, J. Combin. Des. 10 (2002), no. 1, 27-78
DOI
ScienceOn
|
7 |
E. Billington, D. G. Hoffman, and C. A. Rodger, Resolvable gregarious cycle decompositions of complete equipartite graphs, Preprint
|
8 |
N. J. Cavenagh and E. J. Billington, Decomposition of complete multipartite graphs into cycles of even length, Graphs Combin. 16 (2000), no. 1, 49-65
DOI
|
9 |
J. Liu, A generalization of the Oberwolfach problem and -factorizations of complete equipartite graphs, J. Combin. Des. 8 (2000), no. 1, 42-49
DOI
ScienceOn
|