Words and graphs

DOI10.1007/978-3-319-25859-1zbMath1409.05003OpenAlexW2269342346MaRDI QIDQ897110

Sergey Kitaev, Vadim V. Lozin

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

zbMATH Keywords

word-representable graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (35)

Word-representability of split graphs generated by morphisms ⋮ Parikh word representable graphs and morphisms ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ Word-representability of triangulations of grid-covered cylinder graphs ⋮ Word-Representable Graphs: a Survey ⋮ Representing split graphs by words ⋮ Word-representability of face subdivisions of triangular grid graphs ⋮ Properties of \(m\)-bonacci-sum graphs ⋮ Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations ⋮ Parikh word representability of bipartite permutation graphs ⋮ On semi-transitive orientability of Kneser graphs and their complements ⋮ On word-representable and multi-word-representable graphs ⋮ On word-representability of polyomino triangulations ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ On semi-transitive orientability of split graphs ⋮ On operations preserving semi-transitive orientability of graphs ⋮ Bounds on regularity of quadratic monomial ideals ⋮ An embedding technique in the study of word-representability of graphs ⋮ Minimum length word-representants of word-representable graphs ⋮ On graphs with unique geoodesics and antipodes ⋮ On graphs representable by pattern-avoiding words ⋮ Solving computational problems in the theory of word-representable graphs ⋮ Representing graphs via pattern avoiding words ⋮ Classifying \(k\)-edge colouring for \(H\)-free graphs ⋮ Polygon-circle and word-representable graphs ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ On the representation number of a crown graph ⋮ On characterizations for subclasses of directed co-graphs ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ Editing to prime graphs ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ Wiener-type indices of Parikh word representable graphs ⋮ Existence of u -Representation of Graphs ⋮ Word-representability of Toeplitz graphs ⋮ On the 12-representability of induced subgraphs of a grid graph

This page was built for publication: Words and graphs