Words and graphs
From MaRDI portal
Publication:897110
DOI10.1007/978-3-319-25859-1zbMath1409.05003MaRDI QIDQ897110
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
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
68R10: Graph theory (including graph drawing) in computer science
05C75: Structural characterization of families of graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Word-Representable Graphs: a Survey, Existence of u -Representation of Graphs, Word-representability of triangulations of grid-covered cylinder graphs, Word-representability of face subdivisions of triangular grid graphs, Representing graphs via pattern avoiding words, Parikh word representable graphs and morphisms, On word-representability of polyomino triangulations, Leaf realization problem, caterpillar graphs and prefix normal words, On graphs representable by pattern-avoiding words, Classifying \(k\)-edge colouring for \(H\)-free graphs, Polygon-circle and 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, 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, On semi-transitive orientability of Kneser graphs and their complements, Bounds on regularity of quadratic monomial ideals, The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs, Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width, Word-representability of Toeplitz graphs, On operations preserving semi-transitive orientability of graphs, Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations, Solving computational problems in the theory of word-representable graphs, Wiener-type indices of Parikh word representable graphs
