Abstract
Given r ⩾ 3 and 1 ⩽ λ ⩽ r, we determine all values of k for which every r‐regular graph with edge‐connectivity λ has a k‐factor.
Original language | English |
---|---|
Pages (from-to) | 97-103 |
Number of pages | 7 |
Journal | Journal of Graph Theory |
Volume | 9 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1985 |
Externally published | Yes |