1. Graphs and Hypergraphs;Berge,1973
2. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, In: Proceedings of the IJCAI-91, 1991, pp. 331–337
3. M.U. Gerber, D. Kobler, Partitioning a graph to satisfy all vertices, Technical Report, Swiss Federal Institute of Technology, Lausanne, 1998
4. Algorithms for the maximum satisfiability problem;Hansen;Computing,1990