Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs

2013/12/07 by Salvatore Milici, Milici, Salvatore, Zsolt Tuza +1 · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1312.2113

arxiv created 2013/12/07 · arxiv updated 2013/12/10

Abstract

In this paper we consider the uniformly resolvable decompositions of the complete graph K_v, 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 P₃ or K₃.

Cited by

• Uniformly resolvable decompositions of K_v into paths on two, three and four vertices

Related

• Uniformly resolvable decompositions of K_v into paths on two, three and four vertices
• Complex uniformly resolvable decompositions of K_v
• Uniformly resolvable (C₄, K_1,3)-designs of order v and index 2
• Uniformly resolvable decompositions of K_v-I into 5-stars
• Uniformly resolvable decompositions of K_v into 1-factors and odd n-star factors