1. R.J. Bayardo Jr., R.C. Schrag, Using CSP look-back techniques to solve exceptionally hard SAT instances, Principles and Practice of Constraint Programming — CP96, Springer, 1996, pp. 46–60.
2. R. Beigel, D. Eppstein, 3-coloring in time O(1.3446n): a no-MIS algorithm, 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 444–452.
3. Modern Graph Theory;Bollobás,1998
4. B. Bollobás, C. Borgs, J.T. Chayes, J.H. Kim, D.B. Wilson, The scaling window of the 2-SAT transition, 1999, Paper in the xxx.lanl.gov e-Print archive. Available from http://xxx.lanl.gov/abs/math.CO/9909031.
5. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, Proc. 12th IJCAI, 1991, pp. 331–337.