Regular factors of simple regular graphs
✍
Thomas Niessen; Bert Randerath
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 680 KB
Given integers n, r and 2, we determine all values of k for which every simple r-regular graph of order n and with edge-connectivity 2 has a k-factor. Using this result we find for k >~ 2 the k-spectra Spk(n ) = {m: there exists a maximal set of m edge-disjoint k-factors of K~} which were introduced