1. Balas, E., Niehaus, W.: Finding large cliques in arbitrary graphs by bipartite matching. In: Johnson, D., Trick, M. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 29–52. American Mathematical Society, Providence (1996)
2. Berge, C.: Graphe et Hypergraphes. Dunod, Paris (1970)
3. Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization 4 (1999)
4. Bron, C., Kerbosh, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16(9), 575–577 (1973)
5. Busygin, S.: A new trust region technique for the maximum weight clique problem. Submitted to Special Issue of Discrete Applied Mathematics: Combinatorial Optimization (2002)