23 citations · 150 across the 51 of their papers we have counts for
5 papers · 1 filter
Brooks' theorem on powers of graphs
Marthe Bonamy, Nicolas Bousquet
We prove that for , the bound given by Brooks' theorem on the chromatic number of -th powers of graphs of maximum degree can be lowered by 1, even in the case…
List coloring the square of sparse graphs with large degree
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are…
Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
Marthe Bonamy
We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while ensuring that two edges that are incident receive differen…
Recoloring bounded treewidth graphs
Marthe Bonamy, Nicolas Bousquet
Let be an integer. Two vertex -colorings of a graph are \emph{adjacent} if they differ on exactly one vertex. A graph is \emph{-mixing} if any proper -coloring can be…
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are…