21 citations · 185 across the 85 of their papers we have counts for
4 papers · 1 filter
On the representation number of a crown graph
Marc Glen, Sergey Kitaev, Artem Pyatkin
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if is an edge in . It is…
On pattern avoiding indecomposable permutations
Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang
Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecompo…
On 132-representable Graphs
Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if is an edge in . Wor…
On universal partial words
Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze +1
A universal word for a finite alphabet and some integer is a word over such that every word in appears exactly once as a subword (cyclically or linearly). I…