The enumeration of connected graphs and linked diagrams

DOI10.1016/0097-3165(79)90023-2MaRDI QIDQ1132893zbMATH OpenOpenAlexFDO

Authors Albert Nijenhuis, Herbert S. Wilf

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

constructive combinatorial proofsenumerationlabeled connected graphslinked diagramsrecurrence formulas

Mathematics Subject Classification ID

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

Cites work

• A method and two algorithms on the theory of partitions
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• On a class of linked diagrams. I: Enumeration
• The inversion enumerator for labeled trees

Cited in

(14)

• The enumeration of irreducible combinatorial objects
• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• Free cumulants and enumeration of connected partitions
• Signatures of extremal 2-unifrom hypergraphs
• Connected chord diagrams and bridgeless maps
• Wilson loops in terms of color invariants
• Analytic solution of Hedin’s equations in zero dimensions
• New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs
• The combinatorics of a tree-like functional equation for connected chord diagrams
• Irreducible pairings and indecomposable tournaments
• Tubings, chord diagrams, and Dyson-Schwinger equations
• Chords, trees and permutations
• Indecomposable tournaments with minimum Slater index
• Central limit theorem for tensor products of free variables

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

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