4 citations · 5 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Well-quasi-ordering and finite distinguishing number
Aistis Atminas, Robert Brignall
Balogh, Bollobas and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary clas…
math.CO2015★ 4 cited
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
A. Atminas, R. Brignall, V. Lozin +1
We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bicha…