1 paper
Bas Broere, Hans Zantema
A graph is called k-representable if there exists a word w over the nodes of the graph, each node occurring exactly k times, such that there is an edge between two nodes $x,y…