Word-representability of triangulations of grid-covered cylinder graphs

Thomas Z. Q. Chen, Sergey Kitaev, Brian Y. Sun

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\ne y$, alternate in $w$ if and only if $(x,y)\in E$. Hal…