1. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The Maximum Clique Problem. Handbook of Combinatorial Optimization, pp. 1–74. Springer, Boston (1999)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, 340 p. Freeman, San Francisco (1979)
3. Pattillo, J., Butenko, S.: Clique, Independent Set, and Graph Coloring. Encyclopedia of Operations Research and Management Science, pp. 3150–3163 (2011)
4. Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14, 95–116 (1949)
5. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)