Marthe Bonamy - RankMe

143 papers A* 6A 6B 9Misc 1Journal 119Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Gray code for arborescences of tournaments. CoRR Marthe Bonamy, Michael Hoffmann, Clément Legrand-Duchesne, Günter Rote
2026	J	`jnl`	Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. Discret. Math. Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
2026	J	`jnl`	On cuts of small chromatic number in sparse graphs. Discret. Math. Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta
2025	J	`jnl`	Bipartite Turán number of paths and other trees. CoRR Marthe Bonamy, Théotime Leclere, Timothé Picavet
2025	J	`jnl`	Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs. CoRR Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025	A*	`conf`	Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. PODC Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025	J	`jnl`	Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. CoRR Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025	J	`jnl`	On Modular Edge Colourings of Graphs. CoRR Gaétan Berthe, Marthe Bonamy, Fábio Botler, Gaia Carenini, Lucas Colucci, Arthur Dumas, Fatemeh Ghasemi, Pedro Mariano Viana Neto
2025	J	`jnl`	On cuts of small chromatic number in sparse graphs. CoRR Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta
2025	J	`jnl`	On graph classes with constant domination-packing ratio. CoRR Marthe Bonamy, Mónika Csikós, Anna Gujgiczer, Yelena Yuditsky
2025	J	`jnl`	χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs. CoRR Marthe Bonamy, Colin Geniet
2024	J	`jnl`	Edge-colouring graphs with local list sizes. J. Comb. Theory B Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
2024	J	`jnl`	Kempe changes in degenerate graphs. Eur. J. Comb. Marthe Bonamy, Vincent Delecroix, Clément Legrand-Duchesne
2024	J	`jnl`	On a recolouring version of Hadwiger's conjecture. J. Comb. Theory B Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni
2024	J	`jnl`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2023	J	`jnl`	Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory Marthe Bonamy, Théo Pierron, Éric Sopena
2023	B	`conf`	Exploring the Space of Colourings with Kempe Changes (Invited Talk). MFCS Marthe Bonamy
2023	J	`jnl`	Forty years of history. Eur. J. Comb. Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel
2023	J	`jnl`	Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie
2023	J	`jnl`	On Vizing's edge colouring question. J. Comb. Theory B Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
2023	J	`jnl`	On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. Math. Oper. Res. Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber
2023	J	`jnl`	Partitioning edges of a planar graph into linear forests and a matching. CoRR Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
2023	J	`jnl`	Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
2023	J	`jnl`	Separating the edges of a graph by a linear number of paths. CoRR Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan
2023	A*	`conf`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2022	J	`jnl`	Bounding J. Comb. Theory B Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle
2022	J	`jnl`	Colouring graphs with sparse neighbourhoods: Bounds and applications. J. Comb. Theory B Marthe Bonamy, Thomas Perrett, Luke Postle
2022	J	`jnl`	Degeneracy of J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
2022	J	`jnl`	Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2022	J	`jnl`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2022	J	`jnl`	Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
2021	A	`conf`	A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. DISC Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
2021	J	`jnl`	A note on connected greedy edge colouring. Discret. Appl. Math. Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek
2021	J	`jnl`	A note on deterministic zombies. Discret. Appl. Math. Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni
2021	J	`jnl`	A tight local algorithm for the minimum dominating set problem in outerplanar graphs. CoRR Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
2021	—	`conf`	Decomposing the edges of a graph into simpler structures. BCC Marthe Bonamy
2021	J	`jnl`	Dominating sets reconfiguration under token sliding. Discret. Appl. Math. Marthe Bonamy, Paul Dorbec, Paul Ouvrard
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
2021	J	`jnl`	Graph Isomorphism for (H Algorithmica Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
2021	J	`jnl`	Improved pyrotechnics : Closer to the burning graph conjecture. CoRR Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie
2021	J	`jnl`	Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2021	J	`jnl`	Kempe changes in degenerate graphs. CoRR Marthe Bonamy, Vincent Delecroix, Clément Legrand-Duchesne
2021	J	`jnl`	On Vizing's edge colouring question. CoRR Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
2021	J	`jnl`	On a recolouring version of Hadwiger's conjecture. CoRR Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni
2021	A*	`conf`	Optimal labelling schemes for adjacency, comparability, and reachability. STOC Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
2021	J	`jnl`	Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2021	J	`jnl`	The interactive sum choice number of graphs. Discret. Appl. Math. Marthe Bonamy, Kitty Meeks
2021	J	`jnl`	Tuza's Conjecture for Threshold Graphs. CoRR Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
2020	J	`jnl`	A note on deterministic zombies. CoRR Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni
2020	J	`jnl`	Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott
2020	J	`jnl`	Avoidable Paths in Graphs. Electron. J. Comb. Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2020	J	`jnl`	Diameter of colorings under Kempe changes. Theor. Comput. Sci. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2020	J	`jnl`	Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
2020	J	`jnl`	Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
2020	A	`conf`	Limiting Crossing Numbers for Geodesic Drawings on the Sphere. GD Marthe Bonamy, Bojan Mohar, Alexandra Wesolek
2020	J	`jnl`	Limiting crossing numbers for geodesic drawings on the sphere. CoRR Marthe Bonamy, Bojan Mohar, Alexandra Wesolek
2020	J	`jnl`	On the effect of symmetry requirement for rendezvous on the complete graph. CoRR Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni
2020	J	`jnl`	Optimal labelling schemes for adjacency, comparability and reachability. CoRR Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
2020	J	`jnl`	Partitioning the vertices of a torus into isomorphic subgraphs. J. Comb. Theory A Marthe Bonamy, Natasha Morrison, Alex Scott
2020	J	`jnl`	Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
2020	A*	`conf`	Shorter Labeling Schemes for Planar Graphs. SODA Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2020	A	`conf`	Shortest Reconfiguration of Colorings Under Kempe Changes. STACS Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019	J	`jnl`	Avoidable paths in graphs. CoRR Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2019	Misc	`conf`	Diameter of Colorings Under Kempe Changes. COCOON Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019	J	`jnl`	Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
2019	J	`jnl`	Dominating sets reconfiguration under token sliding. CoRR Marthe Bonamy, Paul Dorbec, Paul Ouvrard
2019	A	`conf`	Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2019	J	`jnl`	Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR Marthe Bonamy, Théo Pierron, Éric Sopena
2019	J	`jnl`	Gallai's path decomposition conjecture for graphs of small maximum degree. Discret. Math. Marthe Bonamy, Thomas J. Perrett
2019	B	`conf`	Graph Isomorphism for (H WADS Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Graphs of bounded cliquewidth are polynomially χ-bounded. CoRR Marthe Bonamy, Michal Pilipczuk
2019	J	`jnl`	Independent Feedback Vertex Set for P Algorithmica Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Jones' Conjecture in subcubic graphs. CoRR Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2019	J	`jnl`	On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
2019	J	`jnl`	Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory B Marthe Bonamy, Daniel W. Cranston, Luke Postle
2019	J	`jnl`	Shorter Labeling Schemes for Planar Graphs. CoRR Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2019	B	`conf`	The Perfect Matching Reconfiguration Problem. MFCS Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2019	J	`jnl`	The Perfect Matching Reconfiguration Problem. CoRR Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2019	J	`jnl`	Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018	J	`jnl`	Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications. CoRR Marthe Bonamy, Thomas Perrett, Luke Postle
2018	A*	`conf`	Distributed Coloring in Sparse Graphs with Fewer Colors. PODC Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
2018	A	`conf`	Distributed Recoloring. DISC Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto
2018	J	`jnl`	Distributed Recoloring. CoRR Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto
2018	J	`jnl`	Distributed coloring in sparse graphs with fewer colors. CoRR Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
2018	A*	`conf`	EPTAS for Max Clique on Disks and Unit Balls. FOCS Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018	J	`jnl`	EPTAS for Max Clique on Disks and Unit Balls. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018	J	`jnl`	Enumerating minimal dominating sets in triangle-free graphs. CoRR Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2018	J	`jnl`	Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
2018	J	`jnl`	Graph Isomorphism for (H CoRR Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2018	J	`jnl`	Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2018	B	`conf`	On Directed Feedback Vertex Set Parameterized by Treewidth. WG Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018	J	`jnl`	Recoloring graphs via tree decompositions. Eur. J. Comb. Marthe Bonamy, Nicolas Bousquet
2017	J	`jnl`	Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
2017	J	`jnl`	Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Independent Feedback Vertex Set for P_5-free Graphs. ISAAC Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2017	J	`jnl`	List Coloring with a Bounded Palette. J. Graph Theory Marthe Bonamy, Ross J. Kang
2017	J	`jnl`	On Directed Feedback Vertex Set parameterized by treewidth. CoRR Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2017	J	`jnl`	On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory Marthe Bonamy, Jakub Przybylo
2017	J	`jnl`	On the difference between the Szeged and the Wiener index. Appl. Math. Comput. Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
2017	J	`jnl`	Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Recognizing Graphs Close to Bipartite Graphs. MFCS Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	The Interactive Sum Choice Number of Graphs. CoRR Marthe Bonamy, Kitty Meeks
2017	J	`jnl`	The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. Marthe Bonamy, Kitty Meeks
2017	A	`conf`	Tight Lower Bounds for the Complexity of Multicoloring. ESA Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2017	B	`conf`	Token Sliding on Chordal Graphs. WG Marthe Bonamy, Nicolas Bousquet
2016	J	`jnl`	A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. Marthe Bonamy, Lukasz Kowalik
2016	J	`jnl`	Gallai's path decomposition conjecture for graphs of small maximum degree. CoRR Marthe Bonamy, Thomas Perrett
2016	J	`jnl`	Planar graphs with Δ≥7 and no triangle adjacent to a C Discret. Math. Theor. Comput. Sci. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2016	J	`jnl`	The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discret. Math. Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé
2016	J	`jnl`	Tight lower bounds for the complexity of multicoloring. CoRR Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2016	J	`jnl`	Token Sliding on Chordal Graphs. CoRR Marthe Bonamy, Nicolas Bousquet
2015	—	`—`	Global discharging methods for coloring problems in graphs. (Méthodes de déchargement global pour des problèmes de coloration dans les graphes). Marthe Bonamy
2015	B	`conf`	Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2015	J	`jnl`	Linear kernels for outbranching problems in sparse digraphs. CoRR Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2015	J	`jnl`	On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
2015	J	`jnl`	Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable. SIAM J. Discret. Math. Marthe Bonamy
2015	J	`jnl`	Strong edge coloring sparse graphs. Electron. Notes Discret. Math. Julien Bensmail, Marthe Bonamy, Hervé Hocquard
2014	J	`jnl`	2-Distance Coloring of Sparse Graphs. J. Graph Theory Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition. CoRR Marthe Bonamy, Lukasz Kowalik
2014	B	`conf`	A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. IPEC Marthe Bonamy, Lukasz Kowalik
2014	J	`jnl`	Brooks' theorem on powers of graphs. Discret. Math. Marthe Bonamy, Nicolas Bousquet
2014	J	`jnl`	Graphs with large chromatic number induce $3k$-cycles. CoRR Marthe Bonamy, Pierre Charbit, Stéphan Thomassé
2014	J	`jnl`	Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discret. Math. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Incidence coloring of graphs with high maximum average degree. CoRR Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
2014	J	`jnl`	List coloring the square of sparse graphs with large degree. Eur. J. Comb. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	On the neighbour sum distinguishing index of planar graphs. CoRR Marthe Bonamy, Jakub Przybylo
2014	J	`jnl`	Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Recoloring graphs via tree decompositions. CoRR Marthe Bonamy, Nicolas Bousquet
2014	J	`jnl`	Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2014	J	`jnl`	Reconfiguring Independent Sets in Cographs. CoRR Marthe Bonamy, Nicolas Bousquet
2014	J	`jnl`	The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. CoRR Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé
2013	J	`jnl`	Brooks' theorem on powers of graphs. CoRR Marthe Bonamy, Nicolas Bousquet
2013	J	`jnl`	Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2013	J	`jnl`	List coloring the square of sparse graphs with large degree. CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2013	J	`jnl`	Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable CoRR Marthe Bonamy
2013	J	`jnl`	Recoloring bounded treewidth graphs CoRR Marthe Bonamy, Nicolas Bousquet
2013	J	`jnl`	Recoloring bounded treewidth graphs. Electron. Notes Discret. Math. Marthe Bonamy, Nicolas Bousquet
2011	J	`jnl`	2-distance coloring of sparse graphs. Electron. Notes Discret. Math. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2011	J	`jnl`	On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma