Lower bounds for the clique and the chromatic numbers of a graph

Bondy, 1969, Bounds for the chromatic number of a graph, J. Combin. Theory, 7, 96, 10.1016/S0021-9800(69)80010-4

Edwards, 1977, The largest vertex degree sum for a triangle in a graph, Bull. London Math. Soc., 9, 203, 10.1112/blms/9.2.203

Elphick, 1981, School timetabling and graph colouring

Erdös, 1970, On the graph theorem of Turan (in Hungarian), Mat. Lapok, 21, 249

Bollobás, 1978, 295

Hoffmann, 1970, On eigenvalues and colourings of graphs, 79

Myers, 1972, A lower bound on the chromatic number of a graph, Networks, 1, 273, 10.1002/net.3230010306

Schwenk, 1974, Computing the characteristic polynomial of a graph, 406, 247

Schwenk, 1978, Eigenvalues of graphs, 307

Tutte, 1947, A three colour problem, Eureka

Waller, 1973, Eigenvalues of graphs and operations, Proc. British Combinatorial Conference, 177

Welsh, 1967, An upper bound for the chromatic number of a graph and its application to timetabling problems, Comput. J., 10, 85, 10.1093/comjnl/10.1.85