Word-representability of triangulations of rectangular polyomino with a single domino tile
Combinatorics
2015-09-11 v2
Abstract
A recent elegant result of Akrobotu et al. states that a triangulation of any convex polyomino is word-representable if and only if it is 3-colorable. In this paper, we generalize a particular case of this result by showing that the result of Akrobotu et al. is true even if we allow a domino tile, instead of having just tiles on a rectangular polyomino.
Keywords
Cite
@article{arxiv.1503.05076,
title = {Word-representability of triangulations of rectangular polyomino with a single domino tile},
author = {Marc Glen and Sergey Kitaev},
journal= {arXiv preprint arXiv:1503.05076},
year = {2015}
}
Comments
To appear in the Journal of Combinatorial Mathematics and Combinatorial Computing