The Enumeration of Locally Restricted Graphs (II)

DOI10.1112/jlms/s1-35.3.344zbMath0209.55501OpenAlexW4233823014MaRDI QIDQ5611647

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)

Related Items (20)

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

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