Uniformly resolvable decompositions of $K_v$ into $P_3$ and $K_3$ graphs
Combinatorics
2013-12-10 v1
Abstract
In this paper we consider the uniformly resolvable decompositions of the complete graph , 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 or .
Keywords
Cite
@article{arxiv.1312.2113,
title = {Uniformly resolvable decompositions of $K_v$ into $P_3$ and $K_3$ graphs},
author = {Salvatore Milici and Zsolt Tuza},
journal= {arXiv preprint arXiv:1312.2113},
year = {2013}
}