Abstract
A 2-factor in a graph G is a 2-regular spanning subgraph of G, and a 2-factorization of G is a decomposition of all the edges of G into edge-disjoint 2-factors. A \({\{C_{m}^{r}, C_{n}^{s}\}}\) -factorization of K υ asks for a 2-factorization of K υ , where r of the 2-factors consists of m-cycles, and s of the 2-factors consists of n-cycles. This is a case of the Hamilton-Waterloo problem with uniform cycle sizes m and n. If υ is even, then it is a decomposition of K υ − F where a 1-factor F is removed from K υ . We present necessary and sufficient conditions for the existence of a \({\{C_{4}^{r}, C_{n}^{1}\}}\) -factorization of K υ − F.
This is a preview of subscription content, access via your institution.
References
Adams P., Billington E., Bryant D., El-Zanati S.: On the Hamilton-Waterloo Problem. Gr. Comb. 18, 31–51 (2002)
Alspach B., Schellenberg P.J., Stinson D.R., Wagner D.: The oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory Ser. A 52, 20–43 (1989)
Bermond J.C., Favaron O., Mahéo M.: Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Theory Ser. B 46, 142–153 (1989)
Bryant D., Danziger P.: On bipartite 2-factorisations of K n −I and the Oberwolfach problem. J. Gr. Theory 68(1), 22–37 (2011)
Bryant D., Rodger C.: Cycle decompositions. In: Colbourn, C.J., Dinitz, J.H. Handbook of combinatorial designs, pp. 373–382. Chapman and Hall/CRC, Boca Raton (2007)
Danziger P., Quattrocchi G., Stevens B.: The Hamilton-Waterloo problem for cycle sizes 3 and 4. J. Comb. Des. 17, 342–352 (2009)
Dinitz JH., Ling ACH.: The Hamilton-Waterloo problem: the case of triangle-factors and one Hamilton cycle. J. Comb. Des. 17, 160–176 (2009)
Fu HL., Huang KC.: The Hamilton Waterloo problem for two even cycles factors. Tawanese J. Math. 12(4), 933–940 (2008)
Guy, RK.: Unsolved combinatorial problems. In: Welsh, D.J.A. (ed) Combinatorial Mathematics and its Applications. Proceedings of a Conference held at Oxford 1967, p. 121. Academic Press, New York (1971)
Gvozdjak, P.: On the Oberwolfach problem for cycles with multiple lengths. Ph.D. Thesis, Simon Fraser University, Canada (2004)
Haggkvist R.: A lemma on cycle decompositions. Ann Discret. Math. 27, 227–232 (1985)
Hoffman DG., Schellenberg PJ.: The existence of C k -factorizations of K 2n − F. Discret. Math. 97, 243–250 (1991)
Hilton A.J.W., Johnson M.: Some results on the Oberwolfach problem. J. Lond. Math. Soc. (2) 64, 513–522 (2001)
Horak P., Nedela R., Rosa A.: The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors. Discret. Math. 284, 181–188 (2004)
Kirkman T.P.: On a problem on combinations. Camb. Dublin Math. J. 2, 197–204 (1847)
Lindner, C.C., Rodger, CA.: Design Theory, 2nd edn, p. 223. Chapman and Hall/CRC, Boca Raton (2009)
Lindner C.C., Street A.P.: The Stern-Lenz theorem: background and applications. Congr. Numer. 80, 5–21 (1991)
Liu J.: The equipartite Oberwolfach problem with uniform tables. J. Combin. Theory Ser. A 101 1, 20–34 (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Keranen, M.S., Özkan, S. The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles. Graphs and Combinatorics 29, 1827–1837 (2013). https://doi.org/10.1007/s00373-012-1231-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1231-6
Keywords
- Cycle decomposition 4-cycles
- Difference methods
- 2-factorization