References
- A. D. Akwu and O. Oyewumi, C6 decomposition of the tensor product of complete graphs, Open Journal of Discrete and Applied Mathematics, 3(3) (2020), 62-65. doi: 10.30538/psrp-odam2020.0044
- B. Alspach and H. Gavlas, Cycle decompositions of Kn and Kn –1, J. Combin. Theory Ser. B 81 (2001), 77-99. doi: 10.1006/jctb.2000.1996
- E. J. Billington, Decomposing complete tripartite graphs into cycles of length 3 and 4, Discrete Math. 197/198 (1999), 123-135. doi: 10.1016/S0012-365X(98)00227-1
- E. J. Billington, D. G. Hoffman and B. M. Maenhaut, Group divisible pentagon systems, Util. Math. 55 (1999), 211-219.
- N. J. Cavenagh and E. J. Billington, Decompositions of complete multipartite graphs into cycles of even length, Graphs Combin. 16 (2000), 49-65. doi: 10.1007/s003730050003
- D. G. Hoffman, C. C. Lindner and C. A. Rodger, On the construction of odd cycle systems, J. Graph Theory 13 (1989), 417-426. doi: 10.1002/jgt.3190130405
- T. P. Kirkman, On a problem in combinations, Cambridge and Dublin Math. J. 2 (1847), 191-204.
- C. C. Lindner, C. A. Rodger, Design theory, CRC Press, New York (1997).
- J. Ma, L. Pu and H. Shen, Cycle decomposition of Kn,n – I , SIAM J. Discrete Math. 20 (2006), 603-609. doi: 10.1137/050626363
- R. S. Manikandan and P. Paulraja, Cp -decompositions of some regular graphs, Discrete Math. 306 (2006), 429-451. doi: 10.1016/j.disc.2005.08.006
- R. S. Manikandan and P. Paulraja, C5 -decompositions of the tensor product of complete graphs, Australas. J. Combin. 37 (2007), 285-293.
- R. S. Manikandan and P. Paulraja, C7 -decompositions of the tensor product of complete graphs, Discussiones Mathematicae Graph Theory 37 (2017), 523-535. doi: 10.7151/dmgt.1936
- R. S. Manikandan, P. Paulraja and T. Sivakaran, p2 - Cycle decompositions of the tensor product of complete graphs, Australas. J. Combin. 73(1) (2019), 107-131.
- O. Oyewumi and A. D. Akwu, C4 decomposition of the tensor product of complete graphs, Electron. J. Graph Theory Appl. 8 (1) (2020), 9-15. doi: 10.5614/ejgta.2020.8.1.2
- O. Oyewumi and A. D. Akwu, C10 decompositions of the tensor product of complete graphs, Journal of Information and Optimization Sciences DOI:10.1080/02522667.2020.1866300 (2021), 1-12.
- O. Oyewumi, A. D. Akwu and T. I. Azer, Path decomposition number of certain graphs, Open J. Dis. Appl. Math. 1 (1) (2018), 26-32. doi: 10.30538/psrp-odam2018.0004
- M. Šajna, Cycle decompositions III: complete graphs and fixed length cycles, J. Combin. Designs 10 (2002), 27-78. doi: 10.1002/jcd.1027
- D. Sotteau, Decomposition of Km,n (K*m,n) into cycles (circuits) of length 2k, J. Combin. Theory (Series B), 30 (1981), 75-81. doi: 10.1016/0095-8956(81)90093-9
- B. R. Smith, Decomposing complete equipartite graphs into cycles of length 2p, J. Combin. Des. 16 (2006), 244-252. doi: 10.1002/jcd.20173
- B. R. Smith, Complete equipartite 3p -cycle systems, Australas J. Combin. 45 (2009), 125-138.
- B. R. Smith, Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd, J. Combin. Des. 18 (2010), 401-414. doi: 10.1002/jcd.20268