Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
classification
🧮 math.CO
keywords
graphcompletedecompositionsresolutionresolvableuniformlyappropriateblocks
read the original abstract
In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$, or the complete graph minus a 1-factor as appropriate, into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes are either $P_3$ or $K_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.