Pages that link to "Item:Q1618987"
From MaRDI portal
The following pages link to Dimer problem for some three dimensional lattice graphs (Q1618987):
Displaying 10 items.
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values (Q679048) (← links)
- Dimers on the \(3^3 . 4^2\) lattice (Q1619468) (← links)
- Interpretation of graphs in the lattices of dimension three (Q1921836) (← links)
- An improved upper bound for the \(3\)-dimensional dimer problem (Q1974841) (← links)
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices (Q2122766) (← links)
- The 3D dimer and Ising problems revisited (Q2427544) (← links)
- Exact Entropy of Dimer Coverings for a Class of Lattices in Three or More Dimensions (Q3107700) (← links)
- Generalized expression for the numbers of perfect matching of cylindrical <i>m</i>×<i>n</i> graphs (Q3980916) (← links)
- Dimer coverings on the Tower of Hanoi graph (Q4972871) (← links)
- On the dimer problem of the vertex-edge graph of a cubic graph (Q6041554) (← links)
