1. 1. L. W. Beineke, and A. J. Schwenk. 1975 . On a bipartite form of the Ramsey problem. Proc. Fifth British Combinatorial Conf., Aberdeen. Utilitas Math. Winnipeg, Manitoba. pp.17 -22 .
2. 2. J. M. Benedict, 1976 . On Ramsey numbers defined by factorizations of regular complete multi-partite graphs . Western Michigan University. Doctoral dissertation.
3. A method in graph theory
4. Generalized ramsey theory for graphs - a survey
5. 5. S. A. BurrOn the computational complexity of Ramsey-type problems. To appear.