4 papers · 1 filter
A note on semi-transitivity of Mycielski graphs
Sergey Kitaev, Artem Pyatkin
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transiti…
New tools to study 1-11-representation of graphs
Mikhail Futorny, Sergey Kitaev, Artem Pyatkin
The notion of a -11-representable graph was introduced by Jeff Remmel in 2017 and studied by Cheon et al.\ in 2019 as a natural extension of the extensively studied notion of wo…
Semi-Transitive Orientations and Word-Representable Graphs
Magnús M. Halldórsson, Sergey Kitaev, Artem Pyatkin
A graph is a \emph{word-representable graph} if there exists a word over the alphabet such that letters and alternate in if and only if f…
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 is word-representable if there exists a word over the alpha…