Finding subgraph problem
(This is edited after the conversation in the Comments below)
This is similar to degree-constrained subgraph problems. That is one direction to search in. 

You can drop your 'spanning' requirement since you enforce a minimum degree of 1, which means every vertex has to be included in order to satisfy your degree constraints. It feels like it should be polytime with a max flow solution.