Abstract
In this paper necessary and sufficient conditions are found for the existence of a \(4\)-cycle system of a complete graph on \(n\) vertices with leave a nearly \(2\)-regular graph (that is, a not necessarily spanning graph in which all vertices have degree 2 except for one of degree greater than 2).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alspach, B., Gavlas, H.: Cycle decomposition of \(K_n\) and \(K_{n-1}\). J. Combin. Theory (B) 81, 77–99 (2001)
Ashe, D.J., Rodger, C.A., Fu, H.L.: All 2-regular leaves of partial 6-cycle systems. Ars Combin. 76, 129–150 (2005)
Bryant, D.: Hamilton cycle rich two-factorizations of complete graphs. J. Combin. Designs 12(2), 147–155 (2004)
Buchanan II, H.: Graph factors and hamiltonian decompositions, Ph.D. Dissertation, West Virginia University (1997)
Burling, J., Heinrich, K.: Near 2-factorizations of \(2(K_n)\): cycles of even length. Graphs Combin. 5, 213–221 (1989)
Cavenagh, N.J., Billington, E.J.: Decompositions of complete multipartite graphs into cycles of even length. Graphs Combin. 16, 49–65 (2000)
Colbourn, C.J., Rosa, A.: Quadratic leaves of maximal partial triple systems. Graphs Combin. 2, 317–337 (1986)
Colby, M., Rodger, C.A.: Cycle decompositions of the line graph of \(K_n\). J. Combin. Theory (A) 62, 158–161 (1993)
Cox, B.A., Rodger, C.A.: Cycle systems of the line graph of the complete graph. J. Graph Theory 21, 173–182 (1996)
Fu, C.M., Fu, H.L., Smith, T., Rodger, C.A.: All graphs with maximum degree 3 whose complements have a 4-cycle decomposition. Discrete Math. 308, 2901–2909 (2008)
Fu, H.L., Rodger, C.A.: Four-cycle systems with two-regular leaves. Graphs Combin. 17, 457–461 (2001)
Hoffman, D.G., Lindner, C.C., Rodger, C.A.: On the construction of odd cycle systems. J. Graph Theory 13, 417–426 (1989)
McCauley, L., Rodger, C.A.: Hamilton cycle rich 2-factorizations of complete multipartite graphs. Graphs Combin. 24, 47–52 (2008)
Rees, D.H.: Some designs of use in serology. Biometrics 23, 779–791 (1967)
Rodger, C.A., Sehgal, N.: 4-cycle systems of line graphs of complete multipartite graphs. East West J. Math. Special Volume, 129–136 (2008)
Sajna, M.G.: Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Designs 10, 27–78 (2002)
Smith, B.R., Cavenagh, N.J.: Decomposing complete equipartite graphs into short even cycles. J. Combin. Des. 19, 131–143 (2011)
Sotteau, D.: Decomposition of \(K_{m, n} (K^*_{m, n})\) into cycles (circuits) of length \(2k\). J. Combin. Theory (B) 30, 75–81 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sehgal, N., Rodger, C.A. 4-Cycle Systems of \(K_n - E(F^*)\) . Graphs and Combinatorics 31, 1703–1714 (2015). https://doi.org/10.1007/s00373-014-1433-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-014-1433-1