Picture of neon light reading 'Open'

Discover open research at Strathprints as part of International Open Access Week!

23-29 October 2017 is International Open Access Week. The Strathprints institutional repository is a digital archive of Open Access research outputs, all produced by University of Strathclyde researchers.

Explore recent world leading Open Access research content this Open Access Week from across Strathclyde's many research active faculties: Engineering, Science, Humanities, Arts & Social Sciences and Strathclyde Business School.

Explore all Strathclyde Open Access research outputs...

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)

[img] 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
Restricted to Repository staff only until 9 September 2018.

Download (90kB) | Request a copy from the Strathclyde author

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.