Word-Representable Graphs: a Survey
From MaRDI portal
Publication:4558287
DOI10.1134/S1990478918020084zbMATH Open1413.05264OpenAlexW2805729325MaRDI QIDQ4558287FDOQ4558287
Authors: Sergey Kitaev, Artem 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
Recommendations
- On word-representable and multi-word-representable graphs
- A comprehensive introduction to the theory of word-representable graphs
- Structural properties of word representable graphs
- New results on word-representable graphs
- Solving computational problems in the theory of word-representable graphs
- Word-representability of split graphs
- Word-representability of Toeplitz graphs
- Word-representability of line graphs
- Representing graphs via pattern avoiding words
- Parikh word representable graphs and morphisms
Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 3-coloring in time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized permutation patterns and a classification of the Mahonian statistics
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Patterns in permutations and words.
- A short list color proof of Grötzsch's theorem
- On the complexity of diagram testing
- Bases for equational theories of semi-groups
- The origins of combinatorics on words
- Alternation graphs
- Word-representability of triangulations of grid-covered cylinder graphs
- Title not available (Why is that?)
- Word-representability of face subdivisions of triangular grid graphs
- New results on word-representable graphs
- Graphs Capturing Alternations in Words
- Word-representability of triangulations of rectangular polyomino with a single domino tile
- On the Representability of Line Graphs
- On representable graphs
- Generalized pattern avoidance
- 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.
- Two forbidden induced subgraphs and well-quasi-ordering
- Generalized permutation patterns -- a short survey
- A jump to the Bell number for hereditary graph properties
- Title not available (Why is that?)
- Representing graphs via pattern avoiding words
- On graphs with representation number 3
- Letter graphs and well-quasi-order by induced subgraphs
- From monomials to words to graphs.
- Enumerating split-pair arrangements
- Coloring circle graphs
- On graphs that can be oriented as diagrams of ordered sets
- Title not available (Why is that?)
- On 132-representable graphs
Cited In (24)
- On 132-representable graphs
- Word-representability of Toeplitz graphs
- An embedding technique in the study of word-representability of graphs
- A comprehensive introduction to the theory of word-representable graphs
- Word-representability of split graphs generated by morphisms
- Representing split graphs by words
- Characterizations and directed path-width of sequence digraphs
- Parikh word representability of bipartite permutation graphs
- Word-representability of triangulations of rectangular polyomino with a single domino tile
- Word-representability of graphs with respect to split recomposition
- New results on word-representable graphs
- On representable graphs
- Word-representable graphs: orientations, posets, and bounds
- Structural properties of word representable graphs
- On graphs with representation number 3
- Alternation graphs
- On semi-transitive orientability of Kneser graphs and their complements
- Word-representability of line graphs
- Word-representability of split graphs
- On \(k\)-\(11\)-representable graphs
- On semi-transitive orientability of split graphs
- Solving computational problems in the theory of word-representable graphs
- On graphs representable by pattern-avoiding words
- Human-verifiable proofs in the theory of word-representable graphs
This page was built for publication: Word-Representable Graphs: a Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558287)
