V. Lozin

activity

20032023

most citedClique-width of unit interval graphs

4 citations · 18 across the 31 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

3 papers · 2 filters

math.CO2013

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique

Aistis Atminas, Robert Brignall, Nicholas Korpelainen +2

We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting $P_{5}$ and…

math.CO2013

Universal graphs and universal permutations

Aistis Atminas, Sergey Kitaev, Vadim V. Lozin +1

Let $X$ be a family of graphs and $X_{n}$ the set of $n$ -vertex graphs in $X$ . A graph $U^{(n)}$ containing all graphs from $X_{n}$ as induced subgraphs is called $n$ -universal for $X$ …

math.CO2013

New results on word-representable graphs

Andrew Collins, Sergey Kitaev, Vadim Lozin

A graph $G = (V, E)$ is word-representable 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$ for each $x\neq…