The Enumeration of Locally Restricted Graphs (II)

DOI10.1112/JLMS/S1-35.3.344MaRDI QIDQ5611647zbMATH OpenOpenAlexFDO

Authors Ronald C. Read

Publication date 1960

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s1-35.3.344

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited in

(20)

• Differentiably finite power series
• Matchings in random superpositions of bipartite trees
• The number of symmetric nonnegative integral matrices with prescribed row sums
• Enumeration of cubic graphs by inclusion-exclusion
• Enumeration of mosaics
• The Specker-Blatter theorem does not hold for quaternary relations
• The asymptotic number of claw-free cubic graphs.
• Asymptotic enumeration by degree sequence of graphs of high degree
• Ménage numbers, bijections and P-recursiveness
• Four correspondences between graphs and generalized Young tableaux
• The Hammond Series of a Symmetric Function and Its Application to P-Recursiveness
• Quantum field theory meets Hopf algebra
• Exact sampling and counting for fixed-margin matrices
• Labelled Graphs with Small Vertex Degrees and P-Recursiveness
• On the enumeration of rectangular (0, 1)-matrices
• On the Tutte and Matching Polynomials for Complete Graphs
• Directed random graphs with given degree distributions
• Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
• Enumeration of \((0,1)\)-matrices with constant row and column sums
• Symmetric functions and P-recursiveness

This page was built for publication: The Enumeration of Locally Restricted Graphs (II)

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