François Dross

Colouring diamond-free graphs

The Colouring problem is that of deciding, given a graph

Large induced forests in planar graphs with girth 4 or 5

G

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

and an integer

Colouring Diamond-free Graphs

k

A lower bound on the order of the largest induced forest in planar graphs with high girth

, whether

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

G

Computing Small Pivot-Minors.

admits a (proper)

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree

k

Vertex partitions of

-colouring. For all graphs

(C_3,C_4,C_6)

H