6 citations · 13 across the 7 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
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…
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…
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…