References
- [1] P. A
krobotu , S. Kitaev and Z. Masárova , On word-representability of polyomino triangulations, Siberian Adv. Math., 25 (2015) 1–10. - [2] Z. C
hen , S. Kitaev and B. Y. Sun , Word-representability of face subdivisions of triangular grid graphs, Graphs Combin., 32 (2016) 1749–1761. - [3] Z. C
hen , S. Kitaev and B. Y. Sun , Word-representability of triangulations of grid-covered cylinder graphs, Discrete Appl. Math., 213 (2016) 60–70. - [4] K. D
iks , L. Kowalik and M. Kurowski , A new 3-color criterion for planar graphs, Lecture Notes in Comput. Sci., 2573 (2002) 138–149. - [5] M. G
len and S. Kitaev , Word-representability of triangulations of rectangular polyomino with a single domino tile, J. Combin. Math. Combin. Comput., 101 (2017) 131–144. - [6] M. M. H
alldórsson , S. Kitaev and A. Pyatkin , Semi-transitive orientations and word-representable graphs, Discrete Appl. Math., 201 (2016) 164–171. - [7] S. K
itaev and V. Lozin , CWords and Graphs, Springer, 2015. - [8] S. K
itaev and A. Pyatkin , On representable graphs, J. Autom. Lang. Comb., 13 (2008) 45–54. - [9] S. K
itaev and S. Seif , Word problem of the Perkins semigroup via directed acyclic graphs, Order, 25 (2008) 177–194.