Satisfactory graph partition, variants, and generalizations

The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [EJOR, 125 (2000), 283

• Type: Journal
• Year: 2010
• Where: EOR
• Authors: Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
• Keywords: EOR 2010, Nonempty Parts, Satisfactory Partition, Satisfactory Partition Problem