1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Khyodeno Mozhui, K. V. Krishna
While the problem of determining the representation number of an arbitrary word-representable graph is NP-hard, this problem is open even for bipartite graphs. The representation n…