On word-representable and multi-word-representable graphs

DOI10.1007/978-3-031-33264-7_13MaRDI QIDQ6067337zbMATH OpenFDO

Authors Benny George Kenkireth, Ahaan Sameer Malhotra

Publication date 16 November 2023

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-33264-7_13

zbMATH Keywords

\(k\)-colourable graphsalternation graphsco-bipartite graphscombinatorics on wordsinterval graphsline graphsplanar graphssemi-transitive orientationsplit graphsword-representable graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Alternation graphs
• Efficient graph representations
• Every Planar Map is Four Colorable
• On Complementary Graphs
• On representable graphs
• Semi-transitive orientations and word-representable graphs
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Words and graphs

Cited in

(9)

• On graphs representable by pattern-avoiding words
• Representing split graphs by words
• A comprehensive introduction to the theory of word-representable graphs
• Solving computational problems in the theory of word-representable graphs
• Word-Representable Graphs: a Survey
• Word-representable graphs from a word's perspective
• Multi-word-representability of graphs
• On 1-11-representability and multi-1-11-representability of graphs
• Word-representation numbers of graphs: bottlenecks and bounds

This page was built for publication: On word-representable and multi-word-representable graphs

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