Word-representability of co-bipartite graph

Biswajit Das, Ramesh Hariharasubramanian

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