Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 4690-4696 |
| Number of pages | 7 |
| Journal | Discrete Mathematics |
| Volume | 309 |
| Issue number | 14 |
| DOIs | |
| State | Published - 28 Jul 2009 |
Keywords
- Excessive index
- Excessive near 1-factorization
- Near 1-factor
- Near 1-factorization
Fingerprint Dive into the research topics of 'Excessive near 1-factorizations'. Together they form a unique fingerprint.
Cite this
Cariolaro, D., & Fu, H-L. (2009). Excessive near 1-factorizations. Discrete Mathematics, 309(14), 4690-4696. https://doi.org/10.1016/j.disc.2008.05.035