Excessive near 1-factorizations

David Cariolaro*, Hung-Lin Fu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


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 languageEnglish
Pages (from-to)4690-4696
Number of pages7
JournalDiscrete Mathematics
Issue number14
StatePublished - 28 Jul 2009


  • 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