Colourability and word-representability of near-triangulations

[1] P. Akrobotu, S. Kitaev and Z. Masárova, On word-representability of polyomino triangulations, Siberian Adv. Math., 25 (2015) 1–10.10.3103/S1055134415010010Search in Google Scholar

[2] Z. Chen, S. Kitaev and B. Y. Sun, Word-representability of face subdivisions of triangular grid graphs, Graphs Combin., 32 (2016) 1749–1761.10.1007/s00373-016-1693-zSearch in Google Scholar

[3] Z. Chen, S. Kitaev and B. Y. Sun, Word-representability of triangulations of grid-covered cylinder graphs, Discrete Appl. Math., 213 (2016) 60–70.10.1016/j.dam.2016.05.025Search in Google Scholar

[4] K. Diks, L. Kowalik and M. Kurowski, A new 3-color criterion for planar graphs, Lecture Notes in Comput. Sci., 2573 (2002) 138–149.10.1007/3-540-36379-3_13Search in Google Scholar

[5] M. Glen and S. Kitaev, Word-representability of triangulations of rectangular polyomino with a single domino tile, J. Combin. Math. Combin. Comput., 101 (2017) 131–144.Search in Google Scholar

[6] M. M. Halldórsson, S. Kitaev and A. Pyatkin, Semi-transitive orientations and word-representable graphs, Discrete Appl. Math., 201 (2016) 164–171.10.1016/j.dam.2015.07.033Search in Google Scholar

[7] S. Kitaev and V. Lozin, CWords and Graphs, Springer, 2015.10.1007/978-3-319-25859-1Search in Google Scholar

[8] S. Kitaev and A. Pyatkin, On representable graphs, J. Autom. Lang. Comb., 13 (2008) 45–54.Search in Google Scholar

[9] S. Kitaev and S. Seif, Word problem of the Perkins semigroup via directed acyclic graphs, Order, 25 (2008) 177–194.10.1007/s11083-008-9083-7Search in Google Scholar