Marthe Bonamy

According to our database1, Marthe Bonamy authored at least 62 papers between 2011 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Diameter of colorings under Kempe changes.
Theor. Comput. Sci., 2020

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants.
ACM Trans. Algorithms, 2020

Partitioning the vertices of a torus into isomorphic subgraphs.
J. Comb. Theory, Ser. A, 2020

Limiting crossing numbers for geodesic drawings on the sphere.
CoRR, 2020

A note on deterministic zombies.
CoRR, 2020

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets.
CoRR, 2020

On the effect of symmetry requirement for rendezvous on the complete graph.
CoRR, 2020

Revisiting a Theorem by Folkman on Graph Colouring.
Electron. J. Comb., 2020

Shortest Reconfiguration of Colorings Under Kempe Changes.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Shorter Labeling Schemes for Planar Graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Tight Lower Bounds for the Complexity of Multicoloring.
ACM Trans. Comput. Theory, 2019

Planar graphs of girth at least five are square (Δ + 2)-choosable.
J. Comb. Theory, Ser. B, 2019

On a conjecture of Mohar concerning Kempe equivalence of regular graphs.
J. Comb. Theory, Ser. B, 2019

Gallai's path decomposition conjecture for graphs of small maximum degree.
Discret. Math., 2019

Dominating sets reconfiguration under token sliding.
CoRR, 2019

Jones' Conjecture in subcubic graphs.
CoRR, 2019

Graphs of bounded cliquewidth are polynomially χ-bounded.
CoRR, 2019

Avoidable paths in graphs.
CoRR, 2019

Every planar graph with Δ≥8 is totally (Δ+2)-choosable.
CoRR, 2019

Distributed Coloring in Sparse Graphs with Fewer Colors.
Electron. J. Comb., 2019

Independent Feedback Vertex Set for P<sub>5</sub>-Free Graphs.
Algorithmica, 2019

Graph Isomorphism for (H<sub>1</sub>, H<sub>2</sub>)-Free Graphs: An Almost Complete Dichotomy.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Enumerating Minimal Dominating Sets in Triangle-Free Graphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Perfect Matching Reconfiguration Problem.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Independent feedback vertex sets for graphs of bounded diameter.
Inf. Process. Lett., 2018

Frozen colourings of bounded degree graphs.
Electron. Notes Discret. Math., 2018

Recoloring graphs via tree decompositions.
Eur. J. Comb., 2018

Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications.
CoRR, 2018

On Directed Feedback Vertex Set Parameterized by Treewidth.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Distributed Recoloring.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

EPTAS for Max Clique on Disks and Unit Balls.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
On the Neighbor Sum Distinguishing Index of Planar Graphs.
J. Graph Theory, 2017

List Coloring with a Bounded Palette.
J. Graph Theory, 2017

The Interactive Sum Choice Number of Graphs.
Electron. Notes Discret. Math., 2017

Incidence coloring of graphs with high maximum average degree.
Discret. Appl. Math., 2017

Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration.
CoRR, 2017

On the difference between the Szeged and the Wiener index.
Appl. Math. Comput., 2017

Linear Kernels for Outbranching Problems in Sparse Digraphs.
Algorithmica, 2017

Token Sliding on Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Recognizing Graphs Close to Bipartite Graphs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
A 13k-kernel for planar feedback vertex set via region decomposition.
Theor. Comput. Sci., 2016

The Erdös-Hajnal Conjecture for Long Holes and Antiholes.
SIAM J. Discret. Math., 2016

Planar graphs with Δ≥7 and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable.
Discret. Math. Theor. Comput. Sci., 2016

2015
Global discharging methods for coloring problems in graphs. (Méthodes de déchargement global pour des problèmes de coloration dans les graphes).
PhD thesis, 2015

Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable.
SIAM J. Discret. Math., 2015

Strong edge coloring sparse graphs.
Electron. Notes Discret. Math., 2015

2014
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.
J. Comb. Optim., 2014

List coloring the square of sparse graphs with large degree.
Eur. J. Comb., 2014

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable.
Discret. Math., 2014

Brooks' theorem on powers of graphs.
Discret. Math., 2014

On the neighbour sum distinguishing index of planar graphs.
CoRR, 2014

Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable.
CoRR, 2014

Graphs with large chromatic number induce $3k$-cycles.
CoRR, 2014

The Erdős-Hajnal Conjecture for Long Holes and Anti-holes.
CoRR, 2014

Reconfiguring Independent Sets in Cographs.
CoRR, 2014

A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
Recoloring bounded treewidth graphs.
Electron. Notes Discret. Math., 2013

Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
CoRR, 2013

Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
CoRR, 2013

2011
2-distance coloring of sparse graphs.
Electron. Notes Discret. Math., 2011

On the diameter of reconfiguration graphs for vertex colourings.
Electron. Notes Discret. Math., 2011


  Loading...