Uniformly resolvable decompositions of K_v into paths on two, three and four vertices
classification
🧮 math.CO
keywords
decompositionsgraphresolutionresolvableuniformlyblockscaseclass
read the original abstract
In this paper we consider uniformly resolvable decompositions of the complete graph K_v 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 consist of either P_2, P_3 and P_4.
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.