| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647265 | Discrete Mathematics | 2014 | 5 Pages |
Abstract
In this paper we consider the uniformly resolvable decompositions of the complete graph KvKv, 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 consist of either P3P3s or K3K3s.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Salvatore Milici, Zsolt Tuza,