Word-representability of triangulations of rectangular polyomino with a single domino tile
Glen, Marc and Kitaev, Sergey (2015) Word-representability of triangulations of rectangular polyomino with a single domino tile. Journal of Combinatorial Mathematics and Combinatorial Computing. (In Press)
|
Text (Glen-Kitaev-JCMCC2015-word-representability-of-triangulations-of-rectangular-polyomino)
Glen_Kitaev_JCMCC2015_word_representability_of_triangulations_of_rectangular_polyomino.pdf Accepted Author Manuscript Download (90kB)| Preview |
Abstract
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x,y) is an edge in E . A recent elegant result of Akrobotu et al. [1] states that a triangulation of any convex polyomino is word-representable if and only if it is 3-colourable. In this paper, we generalize a particular case of this result by showing that the result of Akrobotu et al. [1] is true even if we allow a domino tile, instead of having just 1x1 tiles on a rectangular polyomino.
Creators(s): |
Glen, Marc and Kitaev, Sergey ![]() | Item type: | Article |
---|---|
ID code: | 54275 |
Keywords: | word-representability, polyomino, triangulation, domino, Electronic information resources, Library and Information Sciences |
Subjects: | Bibliography. Library Science. Information Resources > Information resources > Electronic information resources |
Department: | Faculty of Science > Computer and Information Sciences |
Depositing user: | Pure Administrator |
Date deposited: | 14 Sep 2015 08:54 |
Last modified: | 29 Dec 2020 01:49 |
Related URLs: | |
URI: | https://strathprints.strath.ac.uk/id/eprint/54275 |
Export data: |