The paper improves the known inclusion between k-local words and (k+1)-representable graphs, but its proof of bounded clique-width for L_k fails on a concrete counterexample.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Word-Representable Graphs and Locality of Words
The paper improves the known inclusion between k-local words and (k+1)-representable graphs, but its proof of bounded clique-width for L_k fails on a concrete counterexample.