The following pages link to Words and graphs (Q897110):
Displayed 35 items.
- Word-representability of triangulations of grid-covered cylinder graphs (Q313795) (← links)
- Word-representability of face subdivisions of triangular grid graphs (Q343715) (← links)
- Representing graphs via pattern avoiding words (Q491554) (← links)
- Parikh word representable graphs and morphisms (Q832963) (← links)
- On word-representability of polyomino triangulations (Q894291) (← links)
- Leaf realization problem, caterpillar graphs and prefix normal words (Q1637224) (← links)
- On graphs representable by pattern-avoiding words (Q1717191) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Polygon-circle and word-representable graphs (Q1739939) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Certain distance-based topological indices of Parikh word representable graphs (Q2038559) (← links)
- Editing to prime graphs (Q2049029) (← links)
- On the 12-representability of induced subgraphs of a grid graph (Q2118234) (← links)
- Word-representability of split graphs generated by morphisms (Q2127634) (← links)
- Representing split graphs by words (Q2158202) (← links)
- Properties of \(m\)-bonacci-sum graphs (Q2161246) (← links)
- Parikh word representability of bipartite permutation graphs (Q2185746) (← links)
- On semi-transitive orientability of Kneser graphs and their complements (Q2185911) (← links)
- Bounds on regularity of quadratic monomial ideals (Q2194763) (← links)
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs (Q2239001) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Word-representability of Toeplitz graphs (Q2334044) (← links)
- On operations preserving semi-transitive orientability of graphs (Q2424730) (← links)
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations (Q2657073) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- Wiener-type indices of Parikh word representable graphs (Q3390052) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- Existence of <i>u</i> -Representation of Graphs (Q4978295) (← links)
- On word-representable and multi-word-representable graphs (Q6067337) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
- On semi-transitive orientability of split graphs (Q6121421) (← links)
- An embedding technique in the study of word-representability of graphs (Q6153476) (← links)
- Minimum length word-representants of word-representable graphs (Q6180656) (← links)
- On graphs with unique geoodesics and antipodes (Q6197732) (← links)