4 papers
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…
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
The class of word-representable graphs, introduced in connection with the study of the Perkins semigroup by Kitaev and Seif, has attracted significant attention in combinatorics an…
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
A graph with vertex set and edge set is said to be word-representable if there exists a word over the alphabet such that, for any two distinct letters…
On semi-transitive orientability of circulant graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
A graph is said to be word-representable if a word can be formed using the letters of the alphabet such that for every pair of vertices and , …