Dimer problem for some three dimensional lattice graphs
From MaRDI portal
Publication:1618987
Recommendations
- On the dimer problem of the vertex-edge graph of a cubic graph
- An improved upper bound for the \(3\)-dimensional dimer problem
- On the monomer-dimer problem of some graphs
- Interpretation of graphs in the lattices of dimension three
- Dimers on graphs in non-orientable surfaces
- The lattice dimension of a graph
- Dimers on the 3³ . 4² lattice
- scientific article; zbMATH DE number 3970801
- scientific article; zbMATH DE number 4123780
- On the dimer problem and the Ising problem in finite \(3\)-dimensional lattices
Cites work
- An improved upper bound for the \(3\)-dimensional dimer problem
- An upper bound for the multidimensional dimer problem
- Combinatorial and topological approach to the 3D Ising model
- Dimer problem in statistical mechanics-an exact result
- Exact solution of the Ising model on group lattices of genus g>1
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Matching theory
- On the dimer problem and the Ising problem in finite \(3\)-dimensional lattices
- Remark on the dimer problem
- Statistical Mechanics of Dimers on a Plane Lattice
- The matching polynomial of a polygraph
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(17)- Dimers on the 3³ . 4² lattice
- Interpretation of graphs in the lattices of dimension three
- An improved upper bound for the \(3\)-dimensional dimer problem
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- The 3D dimer and Ising problems revisited
- Exact entropy of dimer coverings for a class of lattices in three or more dimensions
- scientific article; zbMATH DE number 3887745 (Why is no real title available?)
- A Casimir force in dimer systems
- 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
- Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
- Generalized expression of the perfect matching number for 2×3×n lattices
- Perfect matchings of Fisher graphs of cubic graphs
- Dimer coverings on the Tower of Hanoi graph
- Dimer problem on cylinders: recurrences and generating functions
- On the dimer problem of the vertex-edge graph of a cubic graph
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
- Components of domino tilings under flips in quadriculated tori
This page was built for publication: Dimer problem for some three dimensional lattice graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1618987)