On word-representability of minimal non-comparability graphs

DOI10.1007/978-3-032-17156-6_19MaRDI QIDQ7307328zbMATH OpenFDO

Authors Benny George Kenkireth, G. Sajith, Sreyas Sasidharan

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A comprehensive introduction to the theory of word-representable graphs
• Alternation graphs
• Human-verifiable proofs in the theory of word-representable graphs
• New results on word-representable graphs
• On representable graphs
• Transitiv orientierbare Graphen
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Words and graphs

This page was built for publication: On word-representability of minimal non-comparability graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307328)