# Uniformly resolvable $(C_4, K_{1,3})$-designs of order v and

## DOI:

https://doi.org/10.11575/cdm.v13i1.62548## Keywords:

Design Theory, Resolvable graph decomposition, Uniform resolutions,## Abstract

In this paper we consider the uniformly resolvable decompositions of the complete graph $\lambda K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We consider the cases in which all the resolution classes are either $C_4$ or $K_{1,3}$. We prove that this type of system does not exist for $\lambda$ odd and determine completely the spectrum for $\lambda=2$.## References

2. B. Alspach, P. J. Shellenberg, D. R. Stinson, and D.Wagner, The Oberwolfach problem and factors of uniform length, J. Combin. Theory Ser. A 52 (1989), 20-43.

3. L. Berardi, M. Gionfriddo, and R. Rota, Balanced and strongly balanced Pk-designs, Discrete Math. 312 (2012), 633-636.

4. D. Bryant and P. Danziger, On bipartite 2-factorizations of K_n-I and the Oberwolfach problem, J. Graph Theory 68 (2011), 22-37.

5. D. Bryant, P. Danziger, and W. Pettersson, Bipartite 2-factorizations of complete multipartite graphs, J. Graph Theory 78 (2015), 287-294.

6. D. Bryant and V. Scharaschkin, Complete solutions to the Oberwolfach problem for an infinite set of orders, J. Combin. Theory Ser. B 78 (2009), 904-918.

7. C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, Chapman and Hall/CRC, Boca Raton, FL, 2007, Online updates www.emba.uvm.edu/~dinitz/newresults.html.

8. P. Danziger, G. Quattrocchi, and B. Stevens, The Hamilton-Waterloo problem for cycle sizes 3 and 4, J. Combin. Des. 12 (2004), 221-232.

9. J. H. Dinitz and A. C. H. Ling, The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle, J. Combin. Des. 17 (2009), no. 2, 160-176.

10. J. H. Dinitz, A. C. H. Ling, and P. Danziger, Maximum uniformly resolvable designs with block sizes 2 and 4, Discrete Math. 309 (2009), 4716-4721.

11. M. Gionfriddo, S. S. Kucukcifci, and L. Milazzo, Balanced and strongly balanced 4-kite designs, Util. Math. 91 (2013), 121-129.

12. M. Gionfriddo, L. Milazzo, and V. Voloshin, Hypergraphs and Designs, Mathematics Research Developments, Nova Science Publishers Inc, 2014.

13. M. Gionfriddo and S. Milici, On the existence of uniformly resolvable decompositions of k_v and k_v-i into paths and kites, Discrete Math. 313 (2013), 2830-2834.

14. M. Gionfriddo and S. Milici, Uniformly resolvable H-designs with H = {P_3, P_4}; P_4, Australas. J. Combin. 60 (2014), no. 3, 325-332.

15. M. Gionfriddo and S. Milici, Uniformly resolvable {K_2,P_k}-designs with k = {3, 4}, Contr. Discrete Math. 10 (2015), no. 1, 126-133.

16. P. Horak, R. Nedela, and A. Rosa, The Hamilton-Waterloo problem: the case of Hamilton factors and triangle-factors, Discrete Math. 284 (2004), 181-188.

17. E. Kohler, Das Oberwolfacher problem, Mitt. Math. Gesellsch. Hamburg 10 (1973), 124-129.

18. S. Kucukcifci, G. Lo Faro, S. Milici, and A. Tripodi, Resolvable 3-star designs, Discrete Math. 338 (2015), 608-614.

19. S. Kucukcifci, S. Milici, and Zs. Tuza, Maximum uniformly resolvable decompositions of k_v into 3-stars and 3-cycles, Discrete Math. 338 (2015), 1667-1673.

20. J. Liu, The equipartite Oberwolfach problem with uniform tables, J. Combin. Theory Ser. A 101 (2003), 20-34.

21. J. Liu and D. R. Lick, On lambda-fold equipartite Oberwolfach problem with uniform table sizes, Ann. Combin. 7 (2003), 315-323.

22. S. Milici, A note on uniformly resolvable decompositions of K_v and K_v-I into 2-stars and 4-cycles, Australas. J. Combin. 56 (2013), 195-200.

23. S. Milici and Zs. Tuza, Uniformly resolvable decompositions of K_v into P_3 and K_3 graphs, Discrete Math. 331 (2014), 137-141.

24. W. L. Piotrowski, The solution of the bipartite analogue of the Oberwolfach problem, Discrete Math. 97 (1991), 339-356.

25. R. Rees, Uniformly resolvable pairwise balanced designs with block sizes two and three, J. Combin. Theory Ser. A 45 (1987), 207-225.

26. E. Schuster, Uniformly resolvable designs with index one and block sizes three and five and up to five with blocks of size five, Discrete Math. 309 (2009), 4435-4442.

27. E. Schuster, Uniformly resolvable designs with index one and block sizes three and four-with three or five parallel classes of block size four, Discrete Math. 309 (2009), 2452-2465.

28. E. Schuster, Small uniformly resolvable designs for block sizes 3 and 4, J. Combin. Des. 21 (2013), 481-523.

29. E. Schuster and G. Ge, On uniformly resolvable designs with block sizes 3 and 4, Des. Codes Cryptogr. 57 (2010), 47-69.

30. T. Traetta, A complete solution to the two-table Oberwolfach problems, J. Combin. Theory Ser. A. 120 (2013), 984-997.

## Downloads

## Published

## Issue

## Section

## License

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/

**Attribution-NoDerivsCC BY-ND**

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.