1. On the connection between chromatic number, maximal clique and minimal degree of a graph;Andrásfai;Discrete Math,1974
2. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, vol. 184, Springer, New York, 1998, xiv+394pp.
3. Cycles of even length in graphs;Bondy;J. Comb. Theory Ser. B,1974
4. P. Erdős, Some new applications of probability methods to combinatorial analysis and graph theory, Proc. Vth S. E. Conf. Combinatorics, Graph Theory and Computing, Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man., 1974, pp. 39–51.
5. P. Erdős, R.J. Faudree, A. Gyárfás, R.H. Schelp, Odd cycles in graphs of given minimum degree, Graph Theory, Combinatorics, and Applications, vol. 1 (Kalamazoo, MI, 1988), Wiley-Interscience Publisher, Wiley, New York, 1991.