In [5] Pila presented best possible sufficient conditions for a regular \(\sigma\)-connected graph to have a \(1\)-factor, extending a result of Wallis [7]. Here we present best possible sufficient conditions for a \(\sigma\)-connected regular graph to have a \(k\)-factor for any \(k \geq 2\).