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