King and domino polynomials for polyomino graphs
From MaRDI portal
Publication:4132539
Recommendations
Cites work
- Dimer problem in statistical mechanics-an exact result
- Exact formulas for 2 × n arrays of dumbbells
- Occupation Statistics for Parallel Dumbbells on a 2 × N Lattice Space
- Occupation statistics from exact recursion relations for occupation by dumbbells of a 2 × N array
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(19)- Notes on the asymptotic linearity theorems
- A maximum resonant set of polyomino graphs
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- A minimax result for perfect matchings of a polyomino graph
- Perfect matchings in random polyomino chain graphs
- Regular generalized polyomino graphs
- A survey on orbit polynomials
- Elementary components of essentially disconnected polyomino graphs
- The structure character of essentially disconnected polyomino graphs
- The number of Kekulé structures of polyominos on the torus
- The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
- On \(k\)-resonance of grid graphs on the plane, torus and cylinder
- The spectrum and spanning trees of polyominos on the torus
- On maximal resonance of polyomino graphs
- On some counting polynomials in chemistry
- Cluj polynomials
- Omega polynomial and its use in nanostructure description
- An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
- Enumeration of Wiener indices in random polygonal chains
This page was built for publication: King and domino polynomials for polyomino graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132539)