1. C. Bazgan, Zs. Tuza, D. Vanderpooten, On the existence and determination of satisfactory partitions in a graph, Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), Lecture Notes in Computer Science, vol. 2906, Springer, Berlin, pp. 444–453.
2. On disjoint cycles;Bodlaender;Internat. J. Found. Comput. Sci.,1994
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
4. M. Gerber, D. Kobler, Partitioning a graph to satisfy all vertices, Technical report, Swiss Federal Institute of Technology, Lausanne, 1998.
5. Algorithmic approach to the satisfactory graph partitioning problem;Gerber;European J. Oper. Res.,2000