On the Existence and Determination of Satisfactory Partitions in a Graph

The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi then dVi (v) ≥ s(v), where s(v) ≤ d(v) is a given integer-valued function. This problem was introduced by Gerber and Kobler [EJOR 125 (2000), 283–291] for s = ⌈d 2 ⌉. In this paper we study the complexity of this problem for different values of s.

• Type: Conference
• Year: 2003
• Where: ISAAC
• Authors: Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
• Keywords: Integer-valued Function, ISAAC 2003, Nonempty Sets, Satisfactory Partition Problem