Excessive near 1-factorizations

We begin the study of sets of near 1-factors of graphs GG of odd order whose union contains all the edges of GG and determine, for a few classes of graphs, the minimum number of near 1-factors in such sets.