Wright, E. M. Graphs on unlabelled nodes with a given number of edges. (English) Zbl 0204.57202 Acta Math. 126, 1-9 (1971). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 20 Documents PDFBibTeX XMLCite \textit{E. M. Wright}, Acta Math. 126, 1--9 (1971; Zbl 0204.57202) Full Text: DOI References: [1] de Bruijn, N. G., Chap. 5,Applied combinatorial mathematics. E. F. Beckenback (ed.), New York 1964. [2] Ford, G. W. &Uhlenbeck, G. E., Combinatorial problems in the theory of graphs.Proc. Nat. Acad. Sci. U.S.A., 43 (1957), 163–167. [3] Harary, F., The number of linear, directed, rooted and connected graphs.Trans. Amer. Math. Soc., 78 (1955), 445–463. · Zbl 0065.16702 [4] Oberschelp, W., Kombinatorische Anzahlbestimmungen in Relationen.Math. Ann. 174 (1967), 53–78. · Zbl 0155.35002 [5] Polya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und Chemische Verbindungen.Acta Math., 68 (1937), 145–254. · Zbl 0017.23202 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.