1 citations · 1 across the 8 of their papers we have counts for
4 papers · 1 filter
Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
Khyodeno Mozhui, Tithi Dwary, K. V. Krishna
A graph is said to be word-representable if there exists a word over its vertex set such that any two vertices are adjacent if and only if they alternate in the word. If no such wo…
On the Conjecture of the Representation Number of Bipartite Graphs
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…
Characterization of Split Comparability Graphs
Tithi Dwary, Khyodeno Mozhui, K. V. Krishna
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A split comparability graph is a split graph which is transitively orientable. In…
Representation Number of Word-Representable Split Graphs
Tithi Dwary, Khyodeno Mozhui, K. V. Krishna
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in th…