Lattice animals: Supplementation of perimeter polynomial data by graph-theoretic methods
Authors:
- 1 May 1991
- journal article
- research article
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 63 (3) , 487-489
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Lattice animals: A fast enumeration algorithm and new perimeter polynomialsJournal of Statistical Physics, 1990
- Derivation of series expansions for a study of percolation processesJournal of Physics A: General Physics, 1986
- Generating functions for connected embeddings in a lattice. IV. Site percolationJournal of Physics A: General Physics, 1986
- Generating functions for connected embeddings in a lattice. III. Bond percolationJournal of Physics A: General Physics, 1986
- Generating functions for connected embeddings in a lattice. II. Weak embeddingsJournal of Physics A: General Physics, 1986
- Generating functions for connected embeddings in a lattice. I. Strong embeddingsJournal of Physics A: General Physics, 1986
- Counting polyominoes: Yet another attackDiscrete Mathematics, 1981
- Percolation processes in two dimensions. I. Low-density series expansionsJournal of Physics A: General Physics, 1976
- Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random MixtureJournal of Mathematical Physics, 1966
- Exact Critical Percolation Probabilities for Site and Bond Problems in Two DimensionsJournal of Mathematical Physics, 1964