Let H be a connected subgraph of graph G. An H-factor G is spanning whose components are isomorphic to H. Given set mutually non-isomorphic graphs, uniform H-factorization partition the edges into H-factors for some H∈H. In this article, we give complete solution existence problem H-factorizations Kn−I (the obtained by removing 1-factor from Kn) H={Ch,S(Ch)}, where Ch cycle length an even integ...