1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. 10th ACM-SIAM Symp. Discrete Algorithms, pp. S856–S857 (January 1999), http://www.eecs.uic.edu/~beigel/papers/MIS-SODA:ps:GZ:
2. Byskov, J.M.: Chromatic number in time O(2.4023 n ) using maximal independent sets. Tech. Rep. RS-02-45, BRICS (December 2002)
3. Lecture Notes in Computer Science;D. Eppstein,2001
4. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. ACM Computing Research Repository (April 2003); arXiv:cs.DS./0304018
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)