A Note on Tiling Rectangles with Dominoes
Ronald C. Read · The Fibonacci Quarterly · 1980
In how many ways can an m x n chessboard be covered by dominoes, each. of which covers two adjacent squares? For general m and n this is the "dimer problem " which is known to be difficult (see [2] for details). However, when one of the dimensions,, say m, is small, some results can be obtained,