Pages that link to "Item:Q1144573"
From MaRDI portal
The following pages link to Domino tilings of rectangles with fixed width (Q1144573):
Displaying 13 items.
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- Grid graphs, Gorenstein polytopes, and domino stackings (Q844215) (← links)
- Combinatorial analysis of tetris-like games (Q941345) (← links)
- The matching polynomial of a polygraph (Q1103634) (← links)
- The number of tilings of a block with blocks (Q1114699) (← links)
- Strip tiling and regular grammars (Q1575539) (← links)
- Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of \(2 \times n\) rectangles (Q1752474) (← links)
- On dimer coverings of rectangles of fixed width (Q1821789) (← links)
- 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 (Q3711991) (← links)
- Generating functions for straight polyomino tilings of narrow rectangles (Q5060316) (← links)
- The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams (Q5067064) (← links)
- MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE (Q5151296) (← links)
- The number of ribbon tilings for strips (Q6094716) (← links)