Showing math.COShow all
3 papers · 1 filter
math.CO2026
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…
math.CO2025
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…
math.CO2024
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 , …