Graph G=(V,E)G = (V, E)G=(V,E).
Is there a nonempty subset E′⊆EE' \subseteq EE′⊆E such that in the graph G′=(V′,E′)G' = (V', E')G′=(V′,E′) every vertex has either degree 3 or degree 0?
Transformation from [problem:graph-3-colorability].