The class of H-free graphs has bounded clique-width if and only if H is an induced subgraph
of the 4-vertex path P_4. We study the (un) boundedness of the clique-width of graph …

Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (BH, WH).
We consider three different, natural ways of forbidding H as an induced subgraph in G. First …

A graph is H‐free if it has no induced subgraph isomorphic to H. Brandstädt, Engelfriet, Le,
and Lozin proved that the class of chordal graphs with independence number at most 3 has …

We continue the study into the clique-width of graph classes defined by two forbidden
induced graphs. We present three new classes of bounded clique-width and one of …

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, H_2) …

Given two graphs G and H, we say that G contains H as an induced minor if a graph
isomorphic to H can be obtained from G by a sequence of vertex deletions and edge …

A graph is H-free if it has no induced subgraph isomorphic to H. Brandstädt, Engelfriet, Le
and Lozin proved that the class of chordal graphs with independence number at most 3 has …

A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the
boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of …

This document presents my main research activities during the last six years and concern
problems in combinatorics and can be classified into two principal themes. The first one is a …

Given two graphs G and H, we say that G contains H as an induced minor a graph
isomorphic to H can be obtained from G by a sequence of vertex deletions and edge …