14 citations · 17 across the 3 of their papers we have counts for
1 paper · 1 filter
Sergey Kitaev, Pavel Salimov, Christopher Severs +1
A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) is in E for each x not equal to y. The m…