Daniël Paulusma

activity

20122022

most citedNarrowing the Complexity Gap for Colouring (

C_{s}

P_{t}

)-Free Graphs

8 citations · 14 across the 8 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

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