1 |
B. Alspach and H. Gavlas, Cycle decompositions of and - I, J. Combin. Theory Ser. B 81 (2001), no. 1, 77-99
DOI
ScienceOn
|
2 |
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
|
3 |
J. R. Cho, M. J. Ferrara, R. J. Gould, and J. R. Schmitt, A difference set method for cir- cular decompositions of complete mutipartite graphs into gregarious 4-cycles, Submitted for publication
|
4 |
J. R. Cho and R. J. Gould, Decompositions of complete multipartite graphs into gregar- ious 6-cycles using difference sets, To appear in J. Korean Math. Soc.
과학기술학회마을
DOI
ScienceOn
|
5 |
E. Billington and D. G. Hoffman, Equipartite and almost-equipartite gregarious 4-cycle decompositions, preprint
|
6 |
J. Liu, The equipartite Oberwolfach problem with uniform tables, J. Combin. Theory Ser. A 101 (2003), no. 1, 20-34
DOI
ScienceOn
|
7 |
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
|
8 |
E. Billington, D. G. Hoffman, and C. A. Rodger, Resolvable gregarious cycle decompo- sitions of complete equipartite graphs, Preprint
|
9 |
G. Chartrand and L. Lesniak, Graphs & digraphs: Fourth edition, Chapman & Hall/CRC, Boca Raton, FL, 2005
|
10 |
E. Billington and D. G. Hoffman, Decomposition of complete tripartite graphs into gre- garious 4-cycles, Discrete Math. 261 (2003), no. 1-3, 87-111
DOI
ScienceOn
|
11 |
M. Sajna, On decomposing - I into cycles of a fixed odd length, Discrete Math. 244 (2002), no. 1-3, 435-444
DOI
ScienceOn
|
12 |
M. Sajna, Cycle decompositions. III. Complete graphs and fixed length cycles, J. Combin. Des. 10 (2002), no. 1, 27-78
DOI
ScienceOn
|
13 |
D. Sotteau, Decomposition of into cycles (circuits) of length 2k, J. Combin. Theory Ser. B 30 (1981), no. 1, 75-81
DOI
|