The enumeration of connected graphs and linked diagrams

DOI10.1016/0097-3165(79)90023-2zbMath0421.05038OpenAlexW1987867438MaRDI QIDQ1132893

Herbert S. Wilf, Albert Nijenhuis

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90023-2

zbMATH Keywords

enumerationrecurrence formulasconstructive combinatorial proofslabeled connected graphslinked diagrams

Mathematics Subject Classification ID

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

Related Items (10)

New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs ⋮ Signatures of extremal 2-unifrom hypergraphs ⋮ Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Analytic solution of Hedin’s equations in zero dimensions ⋮ Chords, trees and permutations ⋮ Connected chord diagrams and bridgeless maps ⋮ Wilson loops in terms of color invariants ⋮ Free cumulants and enumeration of connected partitions ⋮ The enumeration of irreducible combinatorial objects

Cites Work

• Unnamed Item
• A method and two algorithms on the theory of partitions
• On a class of linked diagrams. I: Enumeration
• The inversion enumerator for labeled trees

This page was built for publication: The enumeration of connected graphs and linked diagrams