Wright, E. M. Burnside’s lemma: A historical note. (English) Zbl 0385.05042 J. Comb. Theory, Ser. B 30, 89-90 (1981). MSC: 05C30 05-03 01A55 PDFBibTeX XMLCite \textit{E. M. Wright}, J. Comb. Theory, Ser. B 30, 89--90 (1981; Zbl 0385.05042) Full Text: DOI
Wright, E. M. The number of unlabelled graphs with many nodes and edges. (English) Zbl 0254.05112 Bull. Am. Math. Soc. 78, 1032-1034 (1972). MSC: 05C30 PDFBibTeX XMLCite \textit{E. M. Wright}, Bull. Am. Math. Soc. 78, 1032--1034 (1972; Zbl 0254.05112) Full Text: DOI
Wright, E. M. The probability of connectedness of an unlabelled graph can be less for more edges. (English) Zbl 0254.05111 Proc. Am. Math. Soc. 35, 21-25 (1972). MSC: 05C30 05C35 PDFBibTeX XMLCite \textit{E. M. Wright}, Proc. Am. Math. Soc. 35, 21--25 (1972; Zbl 0254.05111) Full Text: DOI
Wright, E. M. Graphs on unlabelled nodes with a given number of edges. (English) Zbl 0204.57202 Acta Math. 126, 1-9 (1971). PDFBibTeX XMLCite \textit{E. M. Wright}, Acta Math. 126, 1--9 (1971; Zbl 0204.57202) Full Text: DOI
Wright, E. M. The number of graphs on many unlabelled nodes. (English) Zbl 0174.26701 Math. Ann. 183, 250-253 (1969). PDFBibTeX XMLCite \textit{E. M. Wright}, Math. Ann. 183, 250--253 (1969; Zbl 0174.26701) Full Text: DOI EuDML