Uniformly resolvable decompositions of Kv into paths on two, three and four vertices
Abstract
In this paper we consider uniformly resolvable decompositions of the complete graph Kv 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 P2, P3 and P4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.