Word-representable graphs from a word's perspective
From MaRDI portal
Publication:6634508
Cites work
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- A comprehensive introduction to the theory of word-representable graphs
- Algorithms on Strings
- Alternation graphs
- Blocksequences of \(k\)-local words
- Colourability and word-representability of near-triangulations
- Existence of \(u\)-representation of graphs
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Graphs Capturing Alternations in Words
- New results on word-representable graphs
- On Burnside's Problem
- On \(k\)-\(11\)-representable graphs
- On operations preserving semi-transitive orientability of graphs
- On representable graphs
- On semi-transitive orientability of split graphs
- On word-representable and multi-word-representable graphs
- Polygon-circle and word-representable graphs
- Representing graphs via pattern avoiding words
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- Words and graphs
This page was built for publication: Word-representable graphs from a word's perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634508)