activity
20142017
most citedBounding the Clique-Width of -free Chordal Graphs

6 citations · 13 across the 7 of their papers we have counts for

collaborators

10 papers

cs.DS2017

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.…

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…

cs.DM2015

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…

cs.DS2015

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…

cs.DS2015

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…

cs.DM2015★ 6 cited

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…

cs.DM2014★ 3 cited

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…

cs.DM2014

Bounding Clique-Width via Perfect Graphs

Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Given two graphs and , a graph is -free if it contains no subgraph isomorphic to or . We continue a recent study into the clique-width of $(H_1…

cs.DM2014★ 1 cited

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…

cs.DM2014★ 3 cited

Classifying the Clique-Width of -Free Bipartite Graphs

Konrad K. Dabrowski, Daniël Paulusma

Let be a bipartite graph, and let be a bipartite graph with a fixed bipartition . We consider three different, natural ways of forbidding as an induced subgr…