Uniformly resolvable decompositions of K_v into paths on two, three and four vertices
Combinatorics
2014-06-18 v1
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.
Cite
@article{arxiv.1406.4279,
title = {Uniformly resolvable decompositions of K_v into paths on two, three and four vertices},
author = {Giovanni Lo Faro and Salvatore Milici and Antoinette Tripodi},
journal= {arXiv preprint arXiv:1406.4279},
year = {2014}
}
Comments
arXiv admin note: text overlap with arXiv:1312.2113