Labelled Graphs with Small Vertex Degrees and P-Recursiveness

DOI10.1137/0607007zbMath0582.05035OpenAlexW1965753739MaRDI QIDQ3705482

David M. Jackson, Ian P. Goulden

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607007

zbMATH Keywords

P-recursive sequencesmaximal degreeD-finitenumber of labelled and simple graphs

Mathematics Subject Classification ID

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

Related Items (4)

Counting on matrices ⋮ Symmetric functions and P-recursiveness ⋮ Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers ⋮ Enumeration of cubic graphs by inclusion-exclusion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differentiably finite power series
• The Hammond Series of a Symmetric Function and Its Application to P-Recursiveness
• Number of labeled 4-regular graphs
• The Enumeration of Locally Restricted Graphs (II)
• Theory and Application of Plane Partitions. Part 2

This page was built for publication: Labelled Graphs with Small Vertex Degrees and P-Recursiveness