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…