The number of unlabelled graphs with many nodes and edges
Open Access
- 1 January 1972
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 78 (6) , 1032-1035
- https://doi.org/10.1090/s0002-9904-1972-13097-0
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 6 references indexed in Scilit:
- The Probability of Connectedness of an Unlabelled Graph Can Be Less for More EdgesProceedings of the American Mathematical Society, 1972
- Graphs on unlabelled nodes with a given number of edgesActa Mathematica, 1971
- XIX.—Asymptotic enumeration of connected graphsProceedings of the Royal Society of Edinburgh. Section A. Mathematical and Physical Sciences, 1970
- Kombinatorische Anzahlbestimmungen in RelationenMathematische Annalen, 1967
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. IVProceedings of the National Academy of Sciences, 1957
- Enumeration Of Labelled GraphsCanadian Journal of Mathematics, 1956