Counting Colored Tilings on Grids and Graphs
<|reference_start|>Counting Colored Tilings on Grids and Graphs: 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.<|reference_end|>
@article{ramírez2024counting,
    title={Counting Colored Tilings on Grids and Graphs},
    author={Jos'e L. Ram'irez (Universidad Nacional de Colombia), Diego
  Villamizar (Universidad Sergio Arboleda)},
    journal={EPTCS 403, 2024, pp. 164-168},
    year={2024},
    doi={10.4204/EPTCS.403.33},
    archivePrefix={arXiv},
    eprint={2406.16415},
    primaryClass={cs.DM math.CO}
}