Factorizations of complete graphs into cycles and 1-factors
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We will focus on the existence of factorizations of $K_v$ containing two nonisomorphic factors. We obtain all possible solutions for uniform factors involving $m$--cycles and $1$--factors with a few possible exceptions when $m$ is odd.
 P. Adams, D. Bryant, S.I. El-Zanati, H. Gavlas, Factorizations of the complete graphinto C5-factors and 1-factors, Graphs Combin. 19 (2003), 289-296.
 B. Alspach, P.J. Schellenberg, D.R. Stinson, Wagner, D., The Oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory Ser. A 52 (1989), 20-43.
 Z. Baranyai, Gy. R. Szasz, Hamiltonian decomposition of lexicographic product, J. Comb. Theory Ser. B 31 (1981), 253 - 261.
 J-C. Bermond, O. Favaron, M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J. Comb. Theory Ser. B 46 (1989), 142-153.
 S. Bonvicini, M. Buratti, Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems, Ars Math. Contemp. 14 (2018), 1-14.
 D. Bryant, P. Danziger and M. Dean, On the Hamilton-Waterloo problem for bipartite 2-factors, J. Combin. Des. 21 (2013), 60-80.
 M. Buratti, P. Danziger, A cyclic solution for an infnite class of Hamilton-Waterloo problems, Graphs Combin. 32 (2016), 521 - 531.
 M. Buratti, G. Rinaldi, On sharply vertex transitive 2-factorizations of the complete graph, J. Comb. Theory Ser. A 111 (2005), 245 - 256.
 A. C. Burgess, P. Danziger, T. Traetta. On the Hamilton-Waterloo problem with odd orders, J. Combin. Des. 25 (2017), 258-287.
 A. C. Burgess, P. Danziger, T. Traetta. On the Hamilton-Waterloo problem with cycle lengths of distinct parities, Discrete Math. 341 (2018), 1636-1644.
 A. C. Burgess, P. Danziger, T. Traetta. On the Hamilton-Waterloo problem with odd cycle lengths, J. Combin. Des. 26 (2018), 51-83.
 N.J. Cavenagh, S.I. El-Zanati, A. Khodkar, C. Vanden Eynden, On a generalization of the Oberwolfach problem, J. Comb. Theory Ser. A 106 (2004), 255-275.
 R. Haggkvist, A lemma on cycle decompositions, Ann. Discrete Math. 27 (1985), 227-232.
 DG. Ho_man, PJ. Schellenberg, The existence of Ck-factorizations of K2n -I, Discrete Math. 97 (1991), 243-250.
 E. Kohler, Uber das Oberwolfacher problem, Beitrage zur Geometrischen Algebra, Basel (1977), 189-201.
 J. Liu, The equipartite Oberwolfach problem with uniform tables, J. Combin. Theory Ser. A 101 (2003), 20-34.
 E. Lucas, R_ecr_eations math_ematiques, Vol. 2 (1892), Gauthier-Villars, Paris.
 U. Odabaşı, S. Özkan, The Hamilton-Waterloo problem with C4 and Cm factors, Discrete Math. 339 (2016), 263-269.
 U. Odabaşı, S. Özkan, Uniformly resolvable cycle decompositions with four different factors, Graphs Combin. 33 (2017), 1591-1606.
 W. L. Piotrowski, Untersuchungen uber das Oberwolfacher problem. Arbeitspapier (1979).
 W. L. Piotrowski, The solution of the bipartite analogue of the Oberwolfach problem, Discrete Math. 97 (1991), 339-356.
 R. Rees, Uniformly Resolvable Pairwise balanced designs with block sizes two and three, J. Comb. Theory Ser. A 45 (1987), 207-225.
 L. Wang, H. Cao, Completing the spectrum of almost resolvable cycle systems with odd cycle length, Discrete Math. 341 (2018), 1479-1491.
 L. Wang, F. Chen, H. Cao, The Hamilton-Waterloo problem for C3-factors and Cn-factors, J. Comb. Des. 25 (2017), 385-418.
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.