Konrad K. Dabrowski

New results on maximum induced matchings in bipartite graphs and beyond

Konrad K. Dabrowski, Marc Demange, Vadim Lozin · Theoretical Computer Science · 2013 · 50 citations

New Results, Graph Theory, Extremal Graph Theory +7

Colouring vertices of triangle-free graphs without forests

Konrad K. Dabrowski, Vadim Lozin, Rajiv Raman et al. · Discrete Mathematics · 2012 · 49 citations

Geometric Graph Theory, Graph Theory, Extremal Graph Theory +4

Independent Feedback Vertex Set for $$P_5$$ P 5 -Free Graphs

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali et al. · Algorithmica · 2018 · 37 citations · Full text

Graph Minor, Network Science, Graph Theory +14

Colouring of graphs with Ramsey-type forbidden subgraphs

Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma · Theoretical Computer Science · 2013 · 34 citations · Full text

Classifying the clique-width of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si106.gif" display="inline" overflow="scroll"><mml:mi>H</mml:mi></mml:math>-free bipartite graphs

Konrad K. Dabrowski, Daniël Paulusma · Discrete Applied Mathematics · 2015 · 33 citations · Full text

Math Xmlns, Network Science, Graph Theory +7