2 papers
math.CO2026
On graph products and multi-word-representability
Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan
The multi-word-representation number is the minimum number of word-representable graphs whose union is . We investigate for graph products obtained from $G_1…
cs.DM2026
Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied clas…