23 citations · 150 across the 51 of their papers we have counts for
5 papers · 1 filter
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
Marthe Bonamy, Nicolas Bousquet, Carl Feghali +1
Let be a graph with a vertex colouring . Let and be two colours. Then a connected component of the subgraph induced by those vertices coloured either or is k…
Linear kernels for outbranching problems in sparse digraphs
Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk +1
In the -Leaf Out-Branching and -Internal Out-Branching problems we are given a directed graph with a designated root and a nonnegative integer . The question is to…
Planar Graphs of Girth at least Five are Square -Choosable
Marthe Bonamy, Daniel W. Cranston, Luke Postle
We prove a conjecture of Dvořák, Král, Nejedlý, and Škrekovski that planar graphs of girth at least five are square -colorable for large enough . In fact, we prove the st…
List colouring with a bounded palette
Marthe Bonamy, Ross J. Kang
Král' and Sgall (2005) introduced a refinement of list colouring where every colour list must be subset to one predetermined palette of colours. We call this -choosabilit…
Incidence coloring of graphs with high maximum average degree
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj +1
An incidence of an undirected graph G is a pair where is a vertex of and an edge of incident with . Two incidences and are adjacent if on…