rtaylor314
Is the following problem NP complete?
For any 3 regular graph G, partion the vertices into 2 sets v1 and v2 such that the subgraphs induced by v1 and v2 each have all degrees at least 2.
For any 3 regular graph G, partion the vertices into 2 sets v1 and v2 such that the subgraphs induced by v1 and v2 each have all degrees at least 2.