default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarthe Bonamy
Person information
- affiliation: University of Bordeaux, LaBRI, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Marthe Bonamy, Vincent Delecroix, Clément Legrand-Duchesne:
Kempe changes in degenerate graphs. Eur. J. Comb. 119: 103802 (2024)- [j56]Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne
, Jonathan Narboni:
On a recolouring version of Hadwiger's conjecture. J. Comb. Theory B 164: 364-370 (2024) - [j55]Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle:
Edge-colouring graphs with local list sizes. J. Comb. Theory B 165: 68-96 (2024) - [j54]Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167: 215-249 (2024) - 2023
- [j53]Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie:
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30(4) (2023) - [j52]Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel:
Forty years of history. Eur. J. Comb. 111: 103689 (2023) - [j51]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. J. Comb. Theory B 159: 126-139 (2023) - [j50]Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory 104(1): 17-86 (2023) - [j49]Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk:
Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory 104(3): 659-677 (2023) - [j48]Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber:
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. Math. Oper. Res. 48(2): 942-953 (2023) - [c22]Marthe Bonamy:
Exploring the Space of Colourings with Kempe Changes (Invited Talk). MFCS 2023: 1:1-1:2 - [c21]Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA 2023: 3006-3028 - [i52]Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan:
Separating the edges of a graph by a linear number of paths. CoRR abs/2301.08707 (2023) - [i51]Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk:
Partitioning edges of a planar graph into linear forests and a matching. CoRR abs/2302.13312 (2023) - 2022
- [j47]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j46]Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. J. Comb. Theory B 152: 353-378 (2022) - [j45]Marthe Bonamy, Thomas Perrett, Luke Postle:
Colouring graphs with sparse neighbourhoods: Bounds and applications. J. Comb. Theory B 155: 278-317 (2022) - [j44]Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle:
Bounding χ by a fraction of Δ for graphs without large cliques. J. Comb. Theory B 157: 263-282 (2022) - [j43]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. 36(3): 2082-2099 (2022) - [i50]Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR abs/2206.00594 (2022) - 2021
- [j42]Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83(3): 822-852 (2021) - [j41]Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28(4) (2021) - [j40]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. 30(3): 330-343 (2021) - [j39]Marthe Bonamy, Kitty Meeks:
The interactive sum choice number of graphs. Discret. Appl. Math. 292: 72-84 (2021) - [j38]Marthe Bonamy, Paul Dorbec, Paul Ouvrard:
Dominating sets reconfiguration under token sliding. Discret. Appl. Math. 301: 6-18 (2021) - [j37]Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni:
A note on deterministic zombies. Discret. Appl. Math. 301: 65-68 (2021) - [j36]Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek:
A note on connected greedy edge colouring. Discret. Appl. Math. 304: 129-136 (2021) - [j35]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68(2): 9:1-9:38 (2021) - [j34]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98(1): 81-109 (2021) - [c20]Marthe Bonamy:
Decomposing the edges of a graph into simpler structures. BCC 2021: 103-132 - [c19]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability, and reachability. STOC 2021: 1109-1117 - [c18]Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek:
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. DISC 2021: 13:1-13:18 - [i49]Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni:
On a recolouring version of Hadwiger's conjecture. CoRR abs/2103.10684 (2021) - [i48]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. CoRR abs/2105.09871 (2021) - [i47]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. CoRR abs/2107.07900 (2021) - [i46]Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek:
A tight local algorithm for the minimum dominating set problem in outerplanar graphs. CoRR abs/2108.02697 (2021) - [i45]Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie:
Improved pyrotechnics : Closer to the burning graph conjecture. CoRR abs/2110.10530 (2021) - [i44]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR abs/2110.15419 (2021) - [i43]Marthe Bonamy, Vincent Delecroix, Clément Legrand-Duchesne:
Kempe changes in degenerate graphs. CoRR abs/2112.02313 (2021) - 2020
- [j33]Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni:
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - [j32]Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut:
Avoidable Paths in Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j31]Marthe Bonamy, Natasha Morrison, Alex Scott:
Partitioning the vertices of a torus into isomorphic subgraphs. J. Comb. Theory A 174: 105252 (2020) - [j30]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms 16(3): 39:1-39:23 (2020) - [j29]Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Diameter of colorings under Kempe changes. Theor. Comput. Sci. 838: 45-57 (2020) - [c17]Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting Crossing Numbers for Geodesic Drawings on the Sphere. GD 2020: 341-355 - [c16]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. SODA 2020: 446-462 - [c15]Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Shortest Reconfiguration of Colorings Under Kempe Changes. STACS 2020: 35:1-35:14 - [i42]Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni:
On the effect of symmetry requirement for rendezvous on the complete graph. CoRR abs/2002.03764 (2020) - [i41]Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine:
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR abs/2004.07214 (2020) - [i40]Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni:
A note on deterministic zombies. CoRR abs/2008.03587 (2020) - [i39]Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting crossing numbers for geodesic drawings on the sphere. CoRR abs/2008.10459 (2020) - [i38]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability and reachability. CoRR abs/2012.01764 (2020) - [i37]Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott:
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR abs/2012.02435 (2020)
2010 – 2019
- 2019
- [j28]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P5-Free Graphs. Algorithmica 81(4): 1342-1369 (2019) - [j27]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26(4): 4 (2019) - [j26]Marthe Bonamy, Thomas J. Perrett:
Gallai's path decomposition conjecture for graphs of small maximum degree. Discret. Math. 342(5): 1293-1299 (2019) - [j25]Marthe Bonamy, Daniel W. Cranston, Luke Postle:
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory B 134: 218-238 (2019) - [j24]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B 135: 179-199 (2019) - [j23]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11(3): 13:1-13:19 (2019) - [c14]Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Diameter of Colorings Under Kempe Changes. COCOON 2019: 52-64 - [c13]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. MFCS 2019: 80:1-80:14 - [c12]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS 2019: 16:1-16:12 - [c11]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. WADS 2019: 181-195 - [i36]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. CoRR abs/1904.06184 (2019) - [i35]Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR abs/1904.12060 (2019) - [i34]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. CoRR abs/1908.03341 (2019) - [i33]Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut:
Avoidable paths in graphs. CoRR abs/1908.03788 (2019) - [i32]Marthe Bonamy, Michal Pilipczuk:
Graphs of bounded cliquewidth are polynomially χ-bounded. CoRR abs/1910.00697 (2019) - [i31]Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in subcubic graphs. CoRR abs/1912.01570 (2019) - [i30]Marthe Bonamy, Paul Dorbec, Paul Ouvrard:
Dominating sets reconfiguration under token sliding. CoRR abs/1912.03127 (2019) - 2018
- [j22]Marthe Bonamy, Nicolas Bousquet:
Recoloring graphs via tree decompositions. Eur. J. Comb. 69: 200-213 (2018) - [j21]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. 68: 167-172 (2018) - [j20]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131: 26-32 (2018) - [c10]Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. FOCS 2018: 568-579 - [c9]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC 2018: 419-425 - [c8]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. DISC 2018: 12:1-12:17 - [c7]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - [i29]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed coloring in sparse graphs with fewer colors. CoRR abs/1802.05582 (2018) - [i28]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. CoRR abs/1802.06742 (2018) - [i27]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. CoRR abs/1803.01822 (2018) - [i26]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating minimal dominating sets in triangle-free graphs. CoRR abs/1810.00789 (2018) - [i25]Marthe Bonamy, Thomas Perrett, Luke Postle:
Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications. CoRR abs/1810.06704 (2018) - [i24]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy. CoRR abs/1811.12252 (2018) - 2017
- [j19]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79(1): 159-188 (2017) - [j18]Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski:
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312: 202-213 (2017) - [j17]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. 227: 29-43 (2017) - [j16]Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. 61: 139-145 (2017) - [j15]Marthe Bonamy, Ross J. Kang:
List Coloring with a Bounded Palette. J. Graph Theory 84(1): 93-103 (2017) - [j14]Marthe Bonamy, Jakub Przybylo:
On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory 85(3): 669-690 (2017) - [c6]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ESA 2017: 18:1-18:14 - [c5]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c4]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [c3]Marthe Bonamy, Nicolas Bousquet:
Token Sliding on Chordal Graphs. WG 2017: 127-139 - [i23]Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. CoRR abs/1703.05380 (2017) - [i22]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - [i21]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i20]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i19]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR abs/1707.09817 (2017) - 2016
- [j13]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable. Discret. Math. Theor. Comput. Sci. 17(3): 131-146 (2016) - [j12]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discret. Math. 30(2): 1159-1164 (2016) - [j11]Marthe Bonamy, Lukasz Kowalik:
A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. 645: 25-40 (2016) - [i18]Marthe Bonamy, Nicolas Bousquet:
Token Sliding on Chordal Graphs. CoRR abs/1605.00442 (2016) - [i17]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight lower bounds for the complexity of multicoloring. CoRR abs/1607.03432 (2016) - [i16]Marthe Bonamy, Thomas Perrett:
Gallai's path decomposition conjecture for graphs of small maximum degree. CoRR abs/1609.06257 (2016) - 2015
- [b1]Marthe Bonamy:
Global discharging methods for coloring problems in graphs. (Méthodes de déchargement global pour des problèmes de coloration dans les graphes). University of Montpellier, France, 2015 - [j10]Julien Bensmail, Marthe Bonamy, Hervé Hocquard:
Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49: 773-778 (2015) - [j9]Marthe Bonamy:
Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable. SIAM J. Discret. Math. 29(3): 1735-1763 (2015) - [c2]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC 2015: 199-211 - [i15]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear kernels for outbranching problems in sparse digraphs. CoRR abs/1509.01675 (2015) - [i14]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR abs/1510.06964 (2015) - 2014
- [j8]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discret. Math. 317: 19-32 (2014) - [j7]Marthe Bonamy, Nicolas Bousquet:
Brooks' theorem on powers of graphs. Discret. Math. 325: 12-16 (2014) - [j6]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. Eur. J. Comb. 41: 128-137 (2014) - [j5]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27(1): 132-143 (2014) - [j4]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-Distance Coloring of Sparse Graphs. J. Graph Theory 77(3): 190-218 (2014) - [c1]Marthe Bonamy, Lukasz Kowalik:
A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. IPEC 2014: 97-109 - [i13]Marthe Bonamy, Nicolas Bousquet:
Recoloring graphs via tree decompositions. CoRR abs/1403.6386 (2014) - [i12]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable. CoRR abs/1405.3422 (2014) - [i11]Marthe Bonamy, Nicolas Bousquet:
Reconfiguring Independent Sets in Cographs. CoRR abs/1406.1433 (2014) - [i10]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. CoRR abs/1408.1964 (2014) - [i9]Marthe Bonamy, Pierre Charbit, Stéphan Thomassé:
Graphs with large chromatic number induce $3k$-cycles. CoRR abs/1408.2172 (2014) - [i8]Marthe Bonamy, Jakub Przybylo:
On the neighbour sum distinguishing index of planar graphs. CoRR abs/1408.3190 (2014) - [i7]Marthe Bonamy, Lukasz Kowalik:
A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition. CoRR abs/1410.8336 (2014) - [i6]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. CoRR abs/1412.6803 (2014) - 2013
- [j3]Marthe Bonamy, Nicolas Bousquet:
Recoloring bounded treewidth graphs. Electron. Notes Discret. Math. 44: 257-262 (2013) - [i5]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable. CoRR abs/1301.7090 (2013) - [i4]Marthe Bonamy, Nicolas Bousquet:
Recoloring bounded treewidth graphs. CoRR abs/1302.3486 (2013) - [i3]Marthe Bonamy:
Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable. CoRR abs/1303.4025 (2013) - [i2]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. CoRR abs/1308.4197 (2013) - [i1]Marthe Bonamy, Nicolas Bousquet:
Brooks' theorem on powers of graphs. CoRR abs/1310.5493 (2013) - 2011
- [j2]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-distance coloring of sparse graphs. Electron. Notes Discret. Math. 38: 155-160 (2011) - [j1]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. 38: 161-166 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
