On word-representability of polyomino triangulations

Prosper Akrobotu, Sergey Kitaev, Zuzana Masárová

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$. So…