The exponential generating function of labelled blocks

DOI10.1016/0012-365X(79)90158-4zbMath0367.05043WikidataQ128017816 ScholiaQ128017816MaRDI QIDQ1242174

E. M. Wright, Nicholas C. Wormald

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items (4)

Counting labelled three-connected and homeomorphically irreducible two- connected graphs ⋮ Counting labeled general cubic graphs ⋮ Counting bridgeless graphs ⋮ Asymptotic enumeration of sparse 2-connected graphs

Cites Work

• Unnamed Item
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• The number of connected sparsely edged graphs. III. Asymptotic results
• On the Enumeration of Mayer Cluster Integrals
• Enumeration of Labelled Graphs I: 3-Connected Graphs

This page was built for publication: The exponential generating function of labelled blocks