4 citations · 18 across the 31 of their papers we have counts for
3 papers · 2 filters
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Daligault, Rao and Thomassé asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamar…
Specifying a positive threshold function via extremal points
Vadim Lozin, Igor Razgon, Viktor Zamaraev +2
An extremal point of a positive threshold Boolean function is either a maximal zero or a minimal one. It is known that if depends on all its variables, then the set of its…
Infinitely many minimal classes of graphs of unbounded clique-width
A. Collins, J. Foniok, N. Korpelainen +2
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely,…