Paul Bonsma

Edge-cuts leaving components of order at least three

Lutz Volkmann, Nicola Ueffing, Paul Bonsma, 2002, Discret. Math..

Using contracted solution graphs for solving reconfiguration problems

Daniël Paulusma, Paul Bonsma, 2019, Acta Informatica.

Sparse cuts, matching-cuts and leafy trees in graphs

Paul Bonsma, P. Bonsma, 2006 .

The complexity of the matching-cut problem for planar graphs and other graph classes

Paul Bonsma, 2009 .

Spanning trees with many leaves: new extremal results and an improved FPT algorithm

Paul Bonsma, 2006 .