| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648403 | Discrete Mathematics | 2009 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David Cariolaro, Hung-Lin Fu,