A. Atminas

activity

20132025

most citedMinimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

4 citations · 5 across the 13 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

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$ …