GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT
(Springer Nature, 2020-12)
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in ...