The number of unlabelled graphs with many nodes and edges

DOI10.1090/S0002-9904-1972-13097-0zbMath0254.05112MaRDI QIDQ5668828

E. M. Wright

Publication date: 1972

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (5)

The visually distinct configurations of k sets ⋮ The number of unlabelled graphs with many nodes and edges ⋮ The probability of connectedness of a large unlabelled graph ⋮ Two problems in the enumeration of unlabelled graphs ⋮ Asymmetric and symmetric graphs

Cites Work

• Kombinatorische Anzahlbestimmungen in Relationen
• Graphs on unlabelled nodes with a given number of edges
• Enumeration Of Labelled Graphs
• The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges
• The number of unlabelled graphs with many nodes and edges
• Unnamed Item

This page was built for publication: The number of unlabelled graphs with many nodes and edges