A. V. Pyatkin

collaborators

2 papers

math.CO2015

Semi-Transitive Orientations and Word-Representable Graphs

Magnús M. Halldórsson, Sergey Kitaev, Artem Pyatkin

A graph $G = (V, E)$ is a \emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x, y) \in E$ f…

math.CO2014

Representing Graphs via Pattern Avoiding Words

Miles Jones, Sergey Kitaev, Artem Pyatkin +1

The notion of a word-representable graph has been studied in a series of papers in the literature. A graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alpha…