11 citations · 17 across the 3 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2013★ 3 cited
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…
cs.DM2013★ 11 cited
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…
cs.DM2013★ 3 cited
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…