Ahlswede, R. and Katona, G. O. H. (1978) Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hungar. 32 97–120.
Andrásfai, B., Erdős, P. and Sós, V. T. (1974) On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math. 8 205–218.
Das, K. (2004) Maximizing the sum of the squares of the degrees of a graph. Discrete Math. 285 57–66.
de Caen, D. (1998) An upper bound on the sum of squares of degrees in a graph. Discrete Math. 185 245–248.
Lo, A. Cliques in graphs with bounded minimum degree. In preparation.
Nikiforov, V. (2007) The sum of the squares of degrees: Sharp asymptotics. Discrete Math. 307 3187–3193.
Olpp, D. (1996) A conjecture of Goodman and the multiplicities of graphs. Austral. J. Combin. 14 267–282.
Székely, L. A., Clark, L. H. and Entriger, R. C. (1992) An inequality for degree sequences. Discrete Math. 103 293–300.