On representable graphs
From MaRDI portal
Recommendations
Cited in
(62)- Representation of graphs by OBDDs
- Counting representable sets on simple graphs
- On graphs representable by pattern-avoiding words
- On the representation number of a crown graph
- On the 12-representability of induced subgraphs of a grid graph
- Word-representability of split graphs generated by morphisms
- Parikh word representability of bipartite permutation graphs
- Word-representability of Toeplitz graphs
- On k-11-representable graphs
- On operations preserving semi-transitive orientability of graphs
- Structural properties of word representable graphs
- Graphs representation
- Representation of Graphs in Diagrams of Graph Theory
- Alternation graphs
- Solving computational problems in the theory of word-representable graphs
- Word-representability of triangulations of grid-covered cylinder graphs
- Word-representability of face subdivisions of triangular grid graphs
- New results on word-representable graphs
- scientific article; zbMATH DE number 15375 (Why is no real title available?)
- On representations of graphs of type A
- Regular set of representatives for time-constrained MSC graphs
- Word-Representable Graphs: a Survey
- On 132-representable graphs
- Representing graphs via pattern avoiding words
- Existence of u-representation of graphs
- On the Representability of Line Graphs
- The \(k\)-dimensional cube is \(k\)-representable
- Word-representability of line graphs
- On graphs with representation number 3
- On word-representable and multi-word-representable graphs
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- On semi-transitive orientability of split graphs
- Human-verifiable proofs in the theory of word-representable graphs
- Minimum length word-representants of word-representable graphs
- Word-representability of graphs with respect to split recomposition
- Minimum length word-representants of graph products
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
- New tools to study 1-11-representation of graphs
- On semi-transitivity of (extended) Mycielski graphs
- Word-representable graphs from a word's perspective
- Word-representable graphs: orientations, posets, and bounds
- '-Rauzy graphs for infinite arrays
- Computing shortest 12-representants of labeled graphs
- Square-free word-representation of word-representable graphs
- Characterization of double-arborescences and their minimum length word-representants
- Word-representable graphs and locality of words
- On semi-transitive orientability of circulant graphs
- Multi-word-representability of graphs
- On 1-11-representability and multi-1-11-representability of graphs
- From word-representable graphs to altered Tverberg-type theorems
- k-11-representations of graphs, revisited
- Word-representation numbers of graphs: bottlenecks and bounds
- On the word-representability of 5-regular circulant graphs
- On word-representability of minimal non-comparability graphs
- Boxicity of a class of split graphs using words
- Word-representable co-bipartite graphs: representation number, speed, and entropy
- Hamiltonian sets of polygonal paths in assembly graphs
- On languages describing large graph classes
- On the representation number of chessboard graphs
- On word-representability of polyomino triangulations
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
This page was built for publication: On representable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503439)
