14 citations · 78 across the 33 of their papers we have counts for
3 papers · 2 filters
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 and…
Linear Clique-Width for Hereditary Classes of Cographs
Robert Brignall, Nicholas Korpelainen, Vincent Vatter
The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary class of cographs has bounded linear clique-width if and only if it does not contai…
Enumerating indices of Schubert varieties defined by inclusions
Michael H. Albert, Robert Brignall
By extending the notion of grid classes to include infinite grids, we establish a structural characterisation of the simple permutations in Av(4231, 35142, 42513, 351624), a patter…