2 citations · 3 across the 14 of their papers we have counts for
4 papers · 1 filter
Characterization of Word-Representable Near-Triangulations
Suchanda Roy, Ramesh Hariharasubramanian
A graph is said to be word-representable if there exists a word over the alphabet such that two distinct letters alternate in if and only if $xy \i…
Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
In this work, we investigate the algorithmic aspects of two natural extensions of hereditary classes: the edge-apex class and the edge-add class, recently introduced by Singh and S…
Word-Representability of Shift Graphs
Suchanda Roy, Ramesh Hariharasubramanian
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if . For integers $n>k>…
On Patterns and Languages in 1-11-Representations of Graphs
Biswajit Das, Ramesh Hariharasubramanian
A 1-11-representation of a graph is a word over the alphabet such that two distinct vertices and are adjacent if and only if the restricted word (obta…