@article{bc2572f9a4084affaccd0870738e5c6d,
title = "THE number of disjoint perfect matchings in semi-regular graphs",
abstract = "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.",
keywords = "Factorization, Hamiltonian Graph, Perfect Matching, Regular Graph, Semiregular Graph",
author = "Hongliang Lu and Wang, {David G.L.}",
year = "2017",
month = apr,
day = "1",
doi = "10.2298/AADM161109030L",
language = "English",
volume = "11",
pages = "11--38",
journal = "Applicable Analysis and Discrete Mathematics",
issn = "1452-8630",
publisher = "University of Belgrade",
number = "1",
}