32 search results - page 1 / 7 » 1-factor covers of regular graphs |
DAM
2011
13 years 5 months ago
2011
JGT
2008
13 years 10 months ago
2008
We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisf...
JCT
1998
13 years 10 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
DM
2008
13 years 11 months ago
2008
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
COMBINATORICS
2007
13 years 10 months ago
2007
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...