D. Paulusma

activity

20092026

most citedSatisfiability of Acyclic and Almost Acyclic CNF Formulas

38 citations · 246 across the 68 of their papers we have counts for

collaborators

Showing 2014 · cs.DMShow all

4 papers · 2 filters

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 $e a$ , $e d$ and $v d$ denote t…

cs.DM2014

Bounding Clique-Width via Perfect Graphs

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

Given two graphs $H_{1}$ and $H_{2}$ , a graph $G$ is $(H_{1}, H_{2})$ -free if it contains no subgraph isomorphic to $H_{1}$ or $H_{2}$ . 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 ${H_{1}, \dots, H_{p}}$ , it is said to be $(H_{1}, \dots, H_{p})$ -free. The class of $H$ -free graphs has bound…

cs.DM2014★ 3 cited

Classifying the Clique-Width of $H$ -Free Bipartite Graphs

Konrad K. Dabrowski, Daniël Paulusma

Let $G$ be a bipartite graph, and let $H$ be a bipartite graph with a fixed bipartition $(B_{H}, W_{H})$ . We consider three different, natural ways of forbidding $H$ as an induced subgr…

Editing to Eulerian Graphs

Bounding Clique-Width via Perfect Graphs

Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs

Classifying the Clique-Width of H-Free Bipartite Graphs

Classifying the Clique-Width of $H$ -Free Bipartite Graphs