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 and…
math.CO2013
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…