The number of disjoint perfect matchings in semi-regular graphs
2017 ◽
Vol 11
(1)
◽
pp. 11-38
We obtain a sharp result that for any even n ? 34, every {Dn,Dn+1}-regular graph of order n contains ?n/4? disjoint perfect matchings, where Dn = 2?n/4?-1. As a consequence, for any integer D ? Dn, every {D, D+1}- regular graph of order n contains (D-?n/4?+1) disjoint perfect matchings.
2009 ◽
Vol 18
(4)
◽
pp. 533-549
◽
Keyword(s):
Keyword(s):
Keyword(s):
1966 ◽
Vol 18
◽
pp. 1091-1094
◽