7 papers
Meta-Theorems for Cuttable Distributed Problems
Marthe Bonamy, Avinandan Das, Cyril Gavoille +3
We prove that given any -approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an -round -approximation LOCAL algorit…
On Modular Edge Colourings of Graphs
Gaétan Berthe, Marthe Bonamy, Fábio Botler +5
Given a graph and an integer , let denote the minimum number of colours required to colour the edges of such that, in each colour class, the subgraph in…
Bipartite Turán number of paths and other trees
Marthe Bonamy, Théotime Leclere, Timothé Picavet
We solve a recent question of Caro, Patkós and Tuza by determining the exact maximum number of edges in a bipartite connected graph as a function of the longest path it contains a…
On cuts of small chromatic number in sparse graphs
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf +2
For a given integer , let denote the supremum such that every sufficiently large graph with average degree less than admits a separator $X \subseteq…
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
Marthe Bonamy, Cyril Gavoille, Timothé Picavet +1
We give a new, short proof that graphs embeddable in a given Euler genus- surface admit a simple -round -approximation distributed algorithm for Minimum Dominating Set…
-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
Marthe Bonamy, Colin Geniet
Merge-width, recently introduced by Dreier and ToruÅczyk, is a common generalisation of bounded expansion classes and twin-width for which the first-order model checking problem r…