The following pages link to Sergey Kitaev (Q284735):
Displaying 50 items.
- Avoiding vincular patterns on alternating words (Q284737) (← links)
- Pattern-avoiding alternating words (Q290100) (← links)
- Word-representability of triangulations of grid-covered cylinder graphs (Q313795) (← links)
- Word-representability of face subdivisions of triangular grid graphs (Q343715) (← links)
- New results on word-representable graphs (Q344843) (← links)
- Harmonic numbers, Catalan's triangle and mesh patterns (Q389209) (← links)
- An involution on \(\beta (1,0)\)-trees (Q394804) (← links)
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics (Q411853) (← links)
- A spectral approach to consecutive pattern-avoiding permutations (Q446004) (← links)
- Number of cycles in the graph of 312-avoiding permutations (Q472163) (← links)
- Representing graphs via pattern avoiding words (Q491554) (← links)
- Pattern avoidance in partial permutations (Q625391) (← links)
- Patterns in permutations and words. (Q632372) (← links)
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements (Q635860) (← links)
- Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees (Q742637) (← links)
- Segmental partially ordered generalized patterns (Q817817) (← links)
- Introduction to partially ordered patterns (Q881572) (← links)
- Crucial and bicrucial permutations with respect to arithmetic monotone patterns (Q890954) (← links)
- On word-representability of polyomino triangulations (Q894291) (← links)
- Mahonian STAT on words (Q894465) (← links)
- Words and graphs (Q897110) (← links)
- Gray coding cubic planar maps (Q906395) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264) (← links)
- On shortest crucial words avoiding abelian powers (Q968182) (← links)
- (2+2)-free posets, ascent sequences and pattern avoiding permutations (Q986124) (← links)
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations (Q1012156) (← links)
- Partially ordered generalized patterns and \(k\)-ary words (Q1407499) (← links)
- Generalized pattern avoidance with additional restrictions (Q1423006) (← links)
- On universal partial words (Q1689916) (← links)
- Polygon-circle and word-representable graphs (Q1739939) (← links)
- On shortening \(u\)-cycles and \(u\)-words for permutations (Q1741513) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- Avoidance of boxed mesh patterns on permutations (Q1759862) (← links)
- Multi-avoidance of generalised patterns (Q1861246) (← links)
- The problem of the pawns (Q1889892) (← links)
- Generalized pattern-matching conditions for \(C_k \wr S_n\) (Q1952724) (← links)
- Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups (Q1952733) (← links)
- On the 12-representability of induced subgraphs of a grid graph (Q2118234) (← links)
- Representing split graphs by words (Q2158202) (← links)
- Semi-transitivity of directed split graphs generated by morphisms (Q2167564) (← links)
- On semi-transitive orientability of Kneser graphs and their complements (Q2185911) (← links)
- Counting independent sets in Riordan graphs (Q2198385) (← links)
- Riordan graphs I: structural properties (Q2272482) (← links)
- Distributions of several infinite families of mesh patterns (Q2287809) (← links)
- On partially ordered patterns of length 4 and 5 in permutations (Q2318773) (← links)
- Distributions of mesh patterns of short lengths (Q2326900) (← links)
- Word-representability of Toeplitz graphs (Q2334044) (← links)
- Frame patterns in \(n\)-cycles (Q2339437) (← links)
- \((a, b)\)-rectangle patterns in permutations and words (Q2345605) (← links)
