The game and movie industries always face the challenge of reproducing materials. This
problem is tackled by combining illumination models and various textures (painted or …

We prove that the number of monomer-dimer tilings of an n× n square grid, with m< n
monomers in which no four tiles meet at any point is m2m+ (m+ 1) 2m+ 1, when m and n …

A covering with dominoes of a rectilinear region is called tatami if no four dominoes meet at
any point. We describe a reduction from planar 3SAT to Domino Tatami Covering. As a …

In this paper we give recursive formulas for the number of colorful tilings of small rectangular
arrays. We enumerate the tilings of a 2× n board with painted squares, dominoes, and I …

We present several new results on the combinatorial properties of a locally restricted version
of monomino-domino coverings of rectilinear regions. These are monomino-domino tatami …

We prove that the number of monomer-dimer tilings of an n× n square grid, with m< n
monomers in which no four tiles meet at any point is m 2 m+(m+ 1) 2 m+ 1, when m and n …

We present two algorithms to list certain classes of monomino-domino coverings which
conform to the\emph {tatami} restriction; no four tiles meet. Our methods exploit structural …

We enumerate a certain class of monomino-domino coverings of square grids, which
conform to the\emph {tatami} restriction; no four tiles meet. Let $\mathbf T_ {n} $ be the set of …

Japanese tatami mats are often arranged so that no four mats meet. This local restriction
imposes a rich combinatorial structure when applied to monomino-domino coverings of …

Motivated by the way Japanese tatami mats are placed on the floor, we consider domino
tilings with a constraint and estimate the number of such tilings of plane regions. We map the …