Marthe Bonamy

activity

20132026

most citedOn the neighbour sum distinguishing index of planar graphs

23 citations · 150 across the 51 of their papers we have counts for

collaborators

Showing 2019 · cs.DMShow all

3 papers · 2 filters

cs.DM2019★ 4 cited

Graphs of bounded cliquewidth are polynomially $χ$ -bounded

Marthe Bonamy, Michał Pilipczuk

We prove that if $C$ is a hereditary class of graphs that is polynomially $χ$ -bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathc…

cs.DM2019

Avoidable paths in graphs

Marthe Bonamy, Oscar Defrain, Meike Hatzel +1

We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises th…

cs.DM2019★ 1 cited

Every planar graph with $Δ ⩾ 8$ is totally $(Δ + 2)$ -choosable

Marthe Bonamy, Théo Pierron, Éric Sopena

Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$ -choosable if for any list assignment of $k$ colors to each vert…

Graphs of bounded cliquewidth are polynomially χ-bounded

Avoidable paths in graphs

Every planar graph with Δ⩾8 is totally (Δ+2)-choosable

Graphs of bounded cliquewidth are polynomially $χ$ -bounded

Every planar graph with $Δ ⩾ 8$ is totally $(Δ + 2)$ -choosable