The Enumeration of Locally Restricted Graphs (I)

DOI10.1112/jlms/s1-34.4.417zbMath0089.18301OpenAlexW1979955099MaRDI QIDQ3263910

Ronald C. Read

Publication date: 1959

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-34.4.417

zbMATH Keywords

topology

Related Items

On the Tutte and Matching Polynomials for Complete Graphs, Permutation invariant Gaussian two-matrix models, Permutational isomers on a molecular skeleton with neighbor-excluding ligands, Redfield's papers and their relevance to counting isomers and isomerizations, Three-dimensional maps and subgroup growth, On multigraphs with a given partition, A bibliography on chromatic polynomials, INGRID: A graph invariant manipulator, Exact sampling and counting for fixed-margin matrices, Universality of iterated networks, Enumeration of \((0,1)\)-matrices with constant row and column sums, The Specker-Blatter theorem does not hold for quaternary relations, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Symmetric functions and P-recursiveness, Matchings in random superpositions of bipartite trees, Balancing the \(n\)-cube: A census of colorings, [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], A double coset ansatz for integrability in AdS/CFT, On the Redfield-Read combinatory algorithm, Enumeration of cubic graphs by inclusion-exclusion, Quantum field theory meets Hopf algebra, Enumeration under two representations of the wreath product, Enumeration of mosaics, Computers and discovery in algebraic graph theory, The theory of compositionals