Konrad K. Dabrowski

activity

20172026

most citedOn the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

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

collaborators

Showing cs.CCShow all

1 paper · 1 filter

cs.CC2017

On Colouring $(2 P_{2}, H)$ -Free and $(P_{5}, H)$ -Free Graphs

Konrad Dabrowski, Daniel Paulusma

The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the…

On Colouring (2P2​,H)-Free and (P5​,H)-Free Graphs

On Colouring $(2 P_{2}, H)$ -Free and $(P_{5}, H)$ -Free Graphs