6 citations · 13 across the 7 of their papers we have counts for
10 papers
On the (parameterized) complexity of recognizing well-covered (r,l)-graphs
Sancrey R. Alves, Konrad K. Dabrowski, Luerbio Faria +3
An -partition of a graph is a partition of its vertex set into independent sets and cliques. A graph is if it admits an -partition.…
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…
Bounding the Clique-Width of -free Split Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
A graph is -free if it has no induced subgraph isomorphic to . We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new…
Editing to a Planar Graph of Given Degrees
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +2
We consider the following graph modification problem. Let the input consist of a graph , a weight function , a cost function $c\colo…
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Konrad K. Dabrowski, Francois Dross, Matthew Johnson +1
A colouring of a graph is a function such that for every . A -regular list assignment of is a function $L…
Bounding the Clique-Width of -free Chordal Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
A graph is -free if it has no induced subgraph isomorphic to . Brandstädt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3…