 Word-representable graph

A **word-representable graph** is a type of graph that can be represented using words in such a way that the vertices of the graph correspond to distinct letters in a set of words, and an edge exists between two vertices if and only if the corresponding letters appear together in at least one of the words.