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). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 05C30 Enumeration in graph theory PDFBibTeX XMLCite \textit{E. M. Wright}, Bull. Am. Math. Soc. 78, 1032--1034 (1972; Zbl 0254.05112) Full Text: DOI References: [1] L. J. Comrie, Chambers’ six-figure math, tables. II, Table XIIA, 1963, pp. 518-519. [2] G. W. Ford and G. E. Uhlenbeck, Combinatorial problems in the theory of graphs. IV, Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 163 – 167. [3] E. N. Gilbert, Enumeration of labelled graphs, Canad. J. Math. 8 (1956), 405 – 411. · Zbl 0071.39102 [4] A. D. Koršunov, The power of certain classes of graphs, Dokl. Akad. Nauk SSSR 193 (1970), 1230 – 1233 (Russian). [5] Walter Oberschelp, Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann. 174 (1967), 53 – 78 (German). · Zbl 0155.35002 [6] M. L. Stein and P. R. Stein, Enumeration of linear graphs and connected linear graphs up to P = 18 points, Los Alamos Scientific Laboratory, 1963. [7] E. M. Wright, Asymptotic enumeration of connected graphs, Proc. Roy. Soc. Edinburgh Sect. A 68 (1968/1970), 298 – 308. · Zbl 0188.55805 [8] E. M. Wright, Graphs on unlabelled nodes with a given number of edges, Acta Math. 126 (1970), 1 – 9. · Zbl 0204.57202 [9] E. M. Wright, Unlabelled graphs with many nodes and edges, Notices Amer. Math. Soc. 19 (1972), A-3. Abstract # 72T-49. · Zbl 0254.05112 [10] E. M. Wright, The probability of connectedness of an unlabelled graph can be less for more edges, Proc. Amer. Math. Soc. 35 (1972), 21 – 25. · Zbl 0254.05111 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.