On languages describing large graph classes

DOI10.1007/978-3-032-28404-4_16MaRDI QIDQ7356301zbMATH OpenFDO

Authors Henning Fernau, Pamela Fleischmann, Kevin Mann, Silas Cato Sacher

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28404-4_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Arithmetical observation
• Enumeration and extensions of word-representants
• Generalized lettericity of graphs
• Graph parameters, implicit representations and factorial properties
• Graph representation functions computable by finite automata
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• Letter graphs and well-quasi-order by induced subgraphs
• On k-11-representable graphs
• On representable graphs
• Properties of graphs specified by a regular language
• Representing graphs via pattern avoiding words
• The space complexity of sum labelling
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Word-representable graphs from a word's perspective
• Words and graphs

This page was built for publication: On languages describing large graph classes

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