Uniformly resolvable (C₄, K_(1,3))-designs of order v and index 2
classification
🧮 math.CO
keywords
graphresolutionresolvableuniformlyblockscasesclassclasses
read the original abstract
In this paper we consider the uniformly resolvable decompositions of the complete graph $2K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases in which all the resolution classes are either $C_4$ or $K_{1,3}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.