1. Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Control 55, 80–88 (1982)
2. Chang, R., Kadin, J., Rohatgi, P.: On unique satisfiability and the threshold behaviour of randomized reductions. J. Comp. Syst. Sci. 50, 359–373 (1995)
3. Chartrand, G., Gavlas, H., Vandell, R.C., Harary, F.: The forcing domination number of a graph. J. Comb. Math. Comb. Comput. 25, 161–174 (1997)
4. Lecture Notes in Mathematics;C.J. Colbourn,1984
5. Crescenzi, P.: A short quide to approximation preserving reductions. In: Proc. of the 12th Ann. Conference on Computational Complexity, pp. 262–272 (1997)