Word-Representable Graphs: a Survey
From MaRDI portal
Publication:4558287
DOI10.1134/S1990478918020084zbMath1413.05264OpenAlexW2805729325MaRDI QIDQ4558287
Sergey Kitaev, Artem V. Pyatkin
Publication date: 21 November 2018
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478918020084
Combinatorics on words (68R15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
On semi-transitive orientability of Kneser graphs and their complements ⋮ Characterizations and directed path-width of sequence digraphs ⋮ On semi-transitive orientability of split graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Word-representability of triangulations of grid-covered cylinder graphs
- Word-representability of face subdivisions of triangular grid graphs
- New results on word-representable graphs
- Representing graphs via pattern avoiding words
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- From monomials to words to graphs.
- Patterns in permutations and words.
- The origins of combinatorics on words
- On word-representability of polyomino triangulations
- Words and graphs
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- On graphs that can be oriented as diagrams of ordered sets
- On the complexity of diagram testing
- Letter graphs and well-quasi-order by induced subgraphs
- A short list color proof of Grötzsch's theorem
- Generalized permutation patterns and a classification of the Mahonian statistics
- Two forbidden induced subgraphs and well-quasi-ordering
- Enumerating split-pair arrangements
- Bases for equational theories of semi-groups
- A jump to the Bell number for hereditary graph properties
- Generalized permutation patterns -- a short survey
- Alternation Graphs
- Coloring circle graphs
- Graphs Capturing Alternations in Words
- On 132-representable Graphs
- 3-coloring in time
- Word-representability of triangulations of rectangular polyomino with a single domino tile
- On the Representability of Line Graphs
- On representable graphs
- On graphs with representation number 3
- Generalized pattern avoidance
This page was built for publication: Word-Representable Graphs: a Survey
