4 citations · 18 across the 31 of their papers we have counts for
Showing 2016 · math.COShow all
2 papers · 2 filters
math.CO2016
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Daligault, Rao and Thomassé asked whether a hereditary class of graphs well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev rece…
math.CO2016
The structure and the number of -free bipartite graphs
Vadim Lozin, Viktor Zamaraev
We show that the number of labelled -free bipartite graphs with vertices grows as . This resolves an open problem posed by Allen [P. Allen, Forbidden induced bip…