In this paper, we explore some generalizations of a counting problem related to tilings in grids of size 2xn, which was originally posed as a question on Mathematics Stack Exchange (Question 3972905). In particular, we consider this problem for the product of two graphs G and P(n), where P(n) is the path graph of n vertices. We give explicit bivariate generating functions for some specific cases.
No takes yet. Share an insight, caveat, or question.
Ramírez et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: