The exponential generating function of labelled blocks

DOI10.1016/0012-365X(79)90158-4MaRDI QIDQ1242174zbMATH OpenWikidataFDO

Authors Edward Maitland Wright, Nicholas 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)

Cites work

• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Enumeration of Labelled Graphs I: 3-Connected Graphs
• On the Enumeration of Mayer Cluster Integrals
• The number of connected sparsely edged graphs. III. Asymptotic results

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242174)