1. J. Abello, S. Butenko, P. Pardalos and M. Resende, Finding independent sets in a graph using continuous multivariable polynomial formulations, J. Global Optim. 21(4) (2001), 111–137.
2. S. Arora and S. Safra, Approximating clique is NP–complete, Proceedings of the 33rd IEEE Symposium on Foundations on Computer Science (1992) (IEEE Computer Society Press, Los Alamitos, California, 1992), 2–13.
3. I. M. Bomze, M. Budinich, P. M. Pardalos and M. Pelillo, The maximum clique problem, in D.-Z. Du and P. M. Pardalos, Eds, Handbook of Combinatorial Optimization (Kluwer Academic Publishers, Dordrecht, 1999), 1–74.
4. A. Brouwer, J. Shearer, N. Sloane and W. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory 36 (1990), 1334–1380.
5. S. Butenko, P. M. Pardalos, I. V. Sergienko, V. Shylo and P. Stetsyuk, Finding maximum independent sets in graphs arising from coding theory, Proceedings of the 17th ACM Symposium on Applied Computing (ACM Press, New York, 2002), 542–546.