The Enumeration of Locally Restricted Graphs (I)
From MaRDI portal
Cited in
(26)- Redfield's papers and their relevance to counting isomers and isomerizations
- INGRID: A graph invariant manipulator
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Matchings in random superpositions of bipartite trees
- Enumeration of cubic graphs by inclusion-exclusion
- Enumeration of mosaics
- The theory of compositionals
- A bibliography on chromatic polynomials
- The Specker-Blatter theorem does not hold for quaternary relations
- A double coset ansatz for integrability in AdS/CFT
- Computers and discovery in algebraic graph theory
- Three-dimensional maps and subgroup growth
- On the Redfield-Read combinatory algorithm
- Enumeration under two representations of the wreath product
- Quantum field theory meets Hopf algebra
- Exact sampling and counting for fixed-margin matrices
- Universality of iterated networks
- On the Tutte and Matching Polynomials for Complete Graphs
- Permutation invariant Gaussian two-matrix models
- On multigraphs with a given partition
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Enumeration of \((0,1)\)-matrices with constant row and column sums
- Multiple-order tensor field theory: enumeration of unitary invariant observables
- Balancing the \(n\)-cube: A census of colorings
- Permutational isomers on a molecular skeleton with neighbor-excluding ligands
- Symmetric functions and P-recursiveness
This page was built for publication: The Enumeration of Locally Restricted Graphs (I)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3263910)
