p-complete square-free Word-representation of Word-representable Graphs

Biswajit Das, Ramesh Hariharasubramanian

A graph G(V, E) is word-representable if there exists a word w over V such that distinct letters x and y alternate in w iff $xy\in E$. We introduce p-complete squares and p-comple…