Words and graphs
DOI10.1007/978-3-319-25859-1zbMATH Open1409.05003OpenAlexW2269342346MaRDI QIDQ897110FDOQ897110
Publication date: 16 December 2015
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-25859-1
Recommendations
- From words to graphs, and back
- A word counting graph
- scientific article; zbMATH DE number 2010449
- Graphs Capturing Alternations in Words
- scientific article; zbMATH DE number 3106306
- scientific article; zbMATH DE number 4047165
- scientific article; zbMATH DE number 1827082
- scientific article; zbMATH DE number 1491629
- scientific article; zbMATH DE number 2087216
Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cited In (44)
- Parikh word representable graphs and morphisms
- Word maps have large image.
- Word-representability of Toeplitz graphs
- On the representation number of a crown graph
- An embedding technique in the study of word-representability of graphs
- On the 12-representability of induced subgraphs of a grid graph
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- Word-representability of split graphs generated by morphisms
- Representing split graphs by words
- Leaf realization problem, caterpillar graphs and prefix normal words
- On characterizations for subclasses of directed co-graphs
- Parikh word representability of bipartite permutation graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Minimum length word-representants of graph products
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
- Word-representability of graphs with respect to split recomposition
- Word-representability of triangulations of grid-covered cylinder graphs
- Word-representability of face subdivisions of triangular grid graphs
- Minimum length word-representants of word-representable graphs
- On operations preserving semi-transitive orientability of graphs
- Certain distance-based topological indices of Parikh word representable graphs
- New tools to study 1-11-representation of graphs
- Word-Representable Graphs: a Survey
- Properties of \(m\)-bonacci-sum graphs
- On graphs with unique geoodesics and antipodes
- On semi-transitivity of (extended) Mycielski graphs
- Word-representable graphs from a word's perspective
- Word-representable graphs: orientations, posets, and bounds
- On word-representability of polyomino triangulations
- Editing to prime graphs
- Computing shortest 12-representants of labeled graphs
- Existence of u -Representation of Graphs
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Representing graphs via pattern avoiding words
- Wiener-type indices of Parikh word representable graphs
- On semi-transitive orientability of Kneser graphs and their complements
- On word-representable and multi-word-representable graphs
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Bounds on regularity of quadratic monomial ideals
- On semi-transitive orientability of split graphs
- Solving computational problems in the theory of word-representable graphs
- On graphs representable by pattern-avoiding words
- Polygon-circle and word-representable graphs
This page was built for publication: Words and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897110)
