A graph G has an \emph{ S -factor} if there exists a spanning subgraph F of G such that for all v V : deg F ( v ) S . The simplest example of such factor is a 1 -factor, which corresponds to a perfect matching in a graph. In this paper we study the computational complexity of finding S -factors in regular graphs. Our techniques combine some classical as well as recent tools from graph theory.