More precisely, the problem is polynomial-time if the graph is 2-colorable, that is, it is bipartite, and is NP-complete otherwise.
customer satisfaction | Computational complexity theory | Object Constraint Language | (I Can't Get No) Satisfaction | Customer satisfaction | computational complexity theory | American Customer Satisfaction Index | Constraint satisfaction | Complexity theory | complexity theory | complete (complexity) | Complement (complexity) |