1. M.Ajtai. Recursive construction for 3-regular expanders. Proc. 28th Annual IEEE Symp. on Foundations of Computer Science (1987), 295–304.
2. S. Arora. Probabilistic checking of proofs and the hardness of approximation problems. PhD Thesis, U.C. Berkeley, 1994. Available via anonymous ftp as Princeton TR94-476.
3. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability — towards tight results. Technical Report ECCC TR95-24, Revised version, September 1995. Extended abstract in Proc. 25th ACM Symp. on Theory of Computing (1993), 113–131, 1993.
4. C. Berge. Graphs. North-Holland Math. Library, Vol. 6, Part 1, Elsevier Science Publishers (1985).
5. C. Berge. Minimax relations for the partial q-colorings of a graph. Disc. Mathematics 74 (1989), 3–14.