Word-representable graphs from a word's perspective
From MaRDI portal
Publication:6634508
DOI10.1007/s00236-024-00462-yMaRDI QIDQ6634508
Dirk Nowotka, Lukas Haschke, Pamela Fleischmann, Tim Löck
Publication date: 7 November 2024
Published in: Acta Informatica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- New results on word-representable graphs
- Representing graphs via pattern avoiding words
- Blocksequences of \(k\)-local words
- Words and graphs
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- Polygon-circle and word-representable graphs
- A comprehensive introduction to the theory of word-representable graphs
- On \(k\)-\(11\)-representable graphs
- On operations preserving semi-transitive orientability of graphs
- Alternation Graphs
- Graphs Capturing Alternations in Words
- Existence of u -Representation of Graphs
- Colourability and word-representability of near-triangulations
- Algorithms on Strings
- On representable graphs
- On Burnside's Problem
- Enumeration and extensions of word-representants
- On word-representable and multi-word-representable graphs
- On semi-transitive orientability of split graphs
This page was built for publication: Word-representable graphs from a word's perspective