3 citations · 4 across the 4 of their papers we have counts for
4 papers
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…
Combinatorics and algorithms for augmenting graphs
Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin +1
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is…
Editing to Eulerian Graphs
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +1
We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let , and denote t…
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs
Konrad K. Dabrowski, Daniël Paulusma
If a graph has no induced subgraph isomorphic to any graph in a finite family , it is said to be -free. The class of -free graphs has bound…