Enumeration of smooth labelled graphs

DOI10.1017/S0308210500017455MaRDI QIDQ3934424zbMATH OpenFDO

Authors Edward Maitland Wright

Publication date 1982

Published in Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0308210500017455

zbMATH Keywords

core and mantle methodrecurrence formula

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites work

• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Enumeration Of Labelled Graphs
• On the strength of connectedness of a random graph
• Some Unusual Enumeration Problems
• The number of connected sparsely edged graphs
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• The number of connected sparsely edged graphs. III. Asymptotic results
• Wright's formulae for the number of connected sparsely edged graphs

Cited in

(5)

• Enumeration of labeled connected bicyclic and tricyclic graphs without bridges
• Labelled graphs with vertices of degree at least three
• Enumeration of point-determining graphs
• An asymptotic expansion for the coefficients of some power series. II: Lagrange inversion
• Wright and Stepanov-Wrigth coefficients

This page was built for publication: Enumeration of smooth labelled graphs

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