Excessive near 1-factorizations
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1016/j.disc.2008.05.035
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 mini mum number of near 1-factors in such sets. (C) 2008 Elsevier B.V. All rights reserved.