The notion of a word-representable graph has been studied in a series of papers in the literature. 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 xy is an edge in E. If V = {1, . . . , n}, this is equivalent to saying that G is word-representable if for all x, y ∈ {1, . . . , n}, xy ∈ E if and only if ...