Title of article
Excessive near 1-factorizations
Author/Authors
Cariolaro، نويسنده , , David and Fu، نويسنده , , Hung-Lin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
4690
To page
4696
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.
Keywords
Near 1-factor , Excessive near 1-factorization , Near 1-factorization , Excessive index
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598985
Link To Document