Domino tilings of rectangles with fixed width
From MaRDI portal
Cites work
Cited in
(14)- The matching polynomial of a polygraph
- The number of tilings of a block with blocks
- Strip tiling and regular grammars
- Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2 n rectangles
- On dimer coverings of rectangles of fixed width
- 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
- Generating functions for straight polyomino tilings of narrow rectangles
- The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams
- Mutually-recursive formulas for enumerating partitions of the rectangle
- The number of ribbon tilings for strips
- An algorithm for counting domino tilings of a rectangular chessboard
- Weak minimization of DFA -- an algorithm and applications
- Grid graphs, Gorenstein polytopes, and domino stackings
- Combinatorial analysis of tetris-like games
This page was built for publication: Domino tilings of rectangles with fixed width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144573)