Enumeration of smooth labelled graphs

DOI10.1017/S0308210500017455zbMath0478.05050MaRDI QIDQ3934424

E. M. Wright

Publication date: 1982

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

zbMATH Keywords

recurrence formulacore and mantle method

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (5)

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

Cites Work

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

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