A graph G has an \emph{S-factor} if there exists a spanning subgraph F of G such that for all v \in V: \deg_F(v) \in 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 ... more >>>