Consider the following two ways to colour the vertices of a graph where the requirement that
adjacent vertices get distinct colours is relaxed. A colouring has" defect" $ d $ if each …

Hadwiger's Conjecture asserts that every K_h-minor-free graph is properly (h-1)-colourable.
We prove the following improper analogue of Hadwiger's Conjecture: for fixed h, every K_h …

The clustering of a graph coloring is the maximum size of monochromatic components. This
paper studies colorings with bounded clustering in graph classes with bounded …

Clustered 3-colouring graphs of bounded degree Page 1 Combinatorics, Probability and
Computing (2022), 31, pp. 123–135 doi:10.1017/S0963548321000213 ARTICLE Clustered …

This paper shows that $ K_t $-minor-free (and $ K_ {s, t} $-minor-free) graphs $ G $ are
subgraphs of products of a tree-like graph $ H $(of bounded treewidth) and a complete …

This thesis contains a brief overview of my research activities between 2009 and 2017 as
Chargé de Recherche CNRS at the G-SCOP laboratory in Grenoble, France. I chose to …

Alon, Seymour, and Thomas [J. Amer. Math. Soc., 3 (1990), pp. 801–808] proved that every-
vertex graph excluding as a minor has treewidth less than. Illingworth, Scott, and Wood …

Recent results show that several important graph classes can be embedded as subgraphs
of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded …

We prove the existence of a function such that the vertices of every planar graph with
maximum degree Δ can be 3-coloured in such a way that each monochromatic component …

Hajós conjectured that every graph containing no subdivision of the complete graph K s+ 1
is properly s-colorable. This conjecture was disproved by Catlin. Indeed, the maximum …