×
Compute Distance To:
Author ID: bonamy.marthe Recent zbMATH articles by "Bonamy, Marthe"
Published as: Bonamy, Marthe; Bonamy, M.
Documents Indexed: 57 Publications since 2011
Co-Authors: 73 Co-Authors with 55 Joint Publications
1,445 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

42 Publications have been cited 208 times in 168 Documents Cited by Year
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
29
2014
On the neighbor sum distinguishing index of planar graphs. Zbl 1367.05066
Bonamy, M.; Przybyło, J.
21
2017
Recoloring graphs via tree decompositions. Zbl 1376.05048
Bonamy, Marthe; Bousquet, Nicolas
15
2018
Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable. Zbl 1279.05020
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
12
2014
2-distance coloring of sparse graphs. Zbl 1304.05042
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
12
2014
The Erdős-Hajnal conjecture for long holes and antiholes. Zbl 1338.05196
Bonamy, Marthe; Bousquet, Nicolas; Thomassé, Stéphan
8
2016
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
8
2019
On the difference between the Szeged and the Wiener index. Zbl 1426.05022
Bonamy, Marthe; Knor, Martin; Lužar, Borut; Pinlou, Alexandre; Škrekovski, Riste
8
2017
Adjacent vertex-distinguishing edge coloring of graphs. Zbl 1291.05055
Bonamy, Marthe; Bousquet, Nicolas; Hocquard, Hervé
8
2013
Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
7
2018
Token sliding on chordal graphs. Zbl 1483.05173
Bonamy, Marthe; Bousquet, Nicolas
7
2017
Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable. Zbl 1321.05061
Bonamy, Marthe
6
2015
Planar graphs of girth at least five are square \((\delta + 2)\)-choosable. Zbl 1402.05043
Bonamy, Marthe; Cranston, Daniel W.; Postle, Luke
6
2019
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Zbl 1404.05049
Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew
6
2019
List coloring the square of sparse graphs with large degree. Zbl 1300.05090
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
5
2014
Enumerating minimal dominating sets in \(K_t\)-free graphs and variants. Zbl 07342482
Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Pilipczuk, Michał; Raymond, Jean-Florent
4
2020
Shorter labeling schemes for planar graphs. Zbl 07304050
Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał
4
2020
Gallai’s path decomposition conjecture for graphs of small maximum degree. Zbl 1407.05189
Bonamy, Marthe; Perrett, Thomas J.
4
2019
2-distance coloring of sparse graphs. Zbl 1274.05145
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
3
2011
On the diameter of reconfiguration graphs for vertex colourings. Zbl 1274.05144
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
3
2011
Strong edge coloring sparse graphs. Zbl 1346.05058
Bensmail, Julien; Bonamy, Marthe; Hocquard, Hervé
3
2015
Recognizing graphs close to bipartite graphs. Zbl 1441.68167
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable. Zbl 1336.05033
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
2
2016
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 07152209
Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
2
2019
The structure of binary matroids with no induced claw or Fano plane restriction. Zbl 1450.05007
Bonamy, Marthe; Kardoš, František; Kelly, Tom; Nelson, Peter; Postle, Luke
2
2019
Graphs of bounded cliquewidth are polynomially \(\chi\)-bounded. Zbl 1450.05072
Bonamy, Marthe; Philipczuk, Michał
2
2020
The interactive sum choice number of graphs. Zbl 1378.05045
Bonamy, Marthe; Meeks, Kitty
2
2017
List coloring with a bounded palette. Zbl 1367.05067
Bonamy, Marthe; Kang, Ross J.
2
2017
Brooks’ theorem on powers of graphs. Zbl 1288.05082
Bonamy, Marthe; Bousquet, Nicolas
1
2014
Dominating sets reconfiguration under token sliding. Zbl 1466.05158
Bonamy, Marthe; Dorbec, Paul; Ouvrard, Paul
1
2021
Frozen \((\Delta+1)\)-colourings of bounded degree graphs. Zbl 1466.05064
Bonamy, Marthe; Bousquet, Nicolas; Perarnau, Guillem
1
2021
Distributed coloring in sparse graphs with fewer colors. Zbl 1427.05121
Aboulker, Pierre; Bonamy, Marthe; Bousquet, Nicolas; Esperet, Louis
1
2019
Partitioning the vertices of a torus into isomorphic subgraphs. Zbl 1439.05184
Bonamy, Marthe; Morrison, Natasha; Scott, Alex
1
2020
Tight lower bounds for the complexity of multicoloring. Zbl 1434.68186
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin
1
2017
Diameter of colorings under Kempe changes. Zbl 1456.05055
Bonamy, Marthe; Heinrich, Marc; Ito, Takehiro; Kobayashi, Yusuke; Mizuta, Haruka; Mühlenthaler, Moritz; Suzuki, Akira; Wasa, Kunihiro
1
2019
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
1
2017
Linear kernels for outbranching problems in sparse digraphs. Zbl 1378.68062
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz
1
2015
Planar graphs with \(\Delta\geq 8\) are \((\Delta+1)\)-edge-choosable. Zbl 1293.05131
Bonamy, Marthe
1
2013
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 07331686
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo
1
2021
Frozen colourings of bounded degree graphs. Zbl 1397.05058
Bonamy, Marthe; Bousquet, Nicolas; Perarnau, Guillem
1
2018
Distributed coloring in sparse graphs with fewer colors. Zbl 1428.68362
Aboulker, Pierre; Bonamy, Marthe; Bousquet, Nicolas; Esperet, Louis
1
2018
Avoidable paths in graphs. Zbl 1454.05058
Bonamy, Marthe; Defrain, Oscar; Hatzel, Meike; Thiebaut, Jocelyn
1
2020
Dominating sets reconfiguration under token sliding. Zbl 1466.05158
Bonamy, Marthe; Dorbec, Paul; Ouvrard, Paul
1
2021
Frozen \((\Delta+1)\)-colourings of bounded degree graphs. Zbl 1466.05064
Bonamy, Marthe; Bousquet, Nicolas; Perarnau, Guillem
1
2021
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 07331686
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo
1
2021
Enumerating minimal dominating sets in \(K_t\)-free graphs and variants. Zbl 07342482
Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Pilipczuk, Michał; Raymond, Jean-Florent
4
2020
Shorter labeling schemes for planar graphs. Zbl 07304050
Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał
4
2020
Graphs of bounded cliquewidth are polynomially \(\chi\)-bounded. Zbl 1450.05072
Bonamy, Marthe; Philipczuk, Michał
2
2020
Partitioning the vertices of a torus into isomorphic subgraphs. Zbl 1439.05184
Bonamy, Marthe; Morrison, Natasha; Scott, Alex
1
2020
Avoidable paths in graphs. Zbl 1454.05058
Bonamy, Marthe; Defrain, Oscar; Hatzel, Meike; Thiebaut, Jocelyn
1
2020
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
8
2019
Planar graphs of girth at least five are square \((\delta + 2)\)-choosable. Zbl 1402.05043
Bonamy, Marthe; Cranston, Daniel W.; Postle, Luke
6
2019
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Zbl 1404.05049
Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew
6
2019
Gallai’s path decomposition conjecture for graphs of small maximum degree. Zbl 1407.05189
Bonamy, Marthe; Perrett, Thomas J.
4
2019
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 07152209
Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
2
2019
The structure of binary matroids with no induced claw or Fano plane restriction. Zbl 1450.05007
Bonamy, Marthe; Kardoš, František; Kelly, Tom; Nelson, Peter; Postle, Luke
2
2019
Distributed coloring in sparse graphs with fewer colors. Zbl 1427.05121
Aboulker, Pierre; Bonamy, Marthe; Bousquet, Nicolas; Esperet, Louis
1
2019
Diameter of colorings under Kempe changes. Zbl 1456.05055
Bonamy, Marthe; Heinrich, Marc; Ito, Takehiro; Kobayashi, Yusuke; Mizuta, Haruka; Mühlenthaler, Moritz; Suzuki, Akira; Wasa, Kunihiro
1
2019
Recoloring graphs via tree decompositions. Zbl 1376.05048
Bonamy, Marthe; Bousquet, Nicolas
15
2018
Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
7
2018
Frozen colourings of bounded degree graphs. Zbl 1397.05058
Bonamy, Marthe; Bousquet, Nicolas; Perarnau, Guillem
1
2018
Distributed coloring in sparse graphs with fewer colors. Zbl 1428.68362
Aboulker, Pierre; Bonamy, Marthe; Bousquet, Nicolas; Esperet, Louis
1
2018
On the neighbor sum distinguishing index of planar graphs. Zbl 1367.05066
Bonamy, M.; Przybyło, J.
21
2017
On the difference between the Szeged and the Wiener index. Zbl 1426.05022
Bonamy, Marthe; Knor, Martin; Lužar, Borut; Pinlou, Alexandre; Škrekovski, Riste
8
2017
Token sliding on chordal graphs. Zbl 1483.05173
Bonamy, Marthe; Bousquet, Nicolas
7
2017
Recognizing graphs close to bipartite graphs. Zbl 1441.68167
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
The interactive sum choice number of graphs. Zbl 1378.05045
Bonamy, Marthe; Meeks, Kitty
2
2017
List coloring with a bounded palette. Zbl 1367.05067
Bonamy, Marthe; Kang, Ross J.
2
2017
Tight lower bounds for the complexity of multicoloring. Zbl 1434.68186
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin
1
2017
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
1
2017
The Erdős-Hajnal conjecture for long holes and antiholes. Zbl 1338.05196
Bonamy, Marthe; Bousquet, Nicolas; Thomassé, Stéphan
8
2016
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable. Zbl 1336.05033
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
2
2016
Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable. Zbl 1321.05061
Bonamy, Marthe
6
2015
Strong edge coloring sparse graphs. Zbl 1346.05058
Bensmail, Julien; Bonamy, Marthe; Hocquard, Hervé
3
2015
Linear kernels for outbranching problems in sparse digraphs. Zbl 1378.68062
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz
1
2015
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
29
2014
Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable. Zbl 1279.05020
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
12
2014
2-distance coloring of sparse graphs. Zbl 1304.05042
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
12
2014
List coloring the square of sparse graphs with large degree. Zbl 1300.05090
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
5
2014
Brooks’ theorem on powers of graphs. Zbl 1288.05082
Bonamy, Marthe; Bousquet, Nicolas
1
2014
Adjacent vertex-distinguishing edge coloring of graphs. Zbl 1291.05055
Bonamy, Marthe; Bousquet, Nicolas; Hocquard, Hervé
8
2013
Planar graphs with \(\Delta\geq 8\) are \((\Delta+1)\)-edge-choosable. Zbl 1293.05131
Bonamy, Marthe
1
2013
2-distance coloring of sparse graphs. Zbl 1274.05145
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre
3
2011
On the diameter of reconfiguration graphs for vertex colourings. Zbl 1274.05144
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
3
2011
all top 5

Cited by 293 Authors

17 Paulusma, Daniël
15 Johnson, Matthew
14 Bonamy, Marthe
13 Feghali, Carl
13 Ito, Takehiro
8 Bousquet, Nicolas
8 Przybyło, Jakub
7 Cranston, Daniel W.
7 Dabrowski, Konrad Kazimierz
7 Wu, Jian-Liang
6 Zhou, Xiao
5 Bu, Yuehua
5 Chudnovsky, Maria
5 Ono, Hirotaka
5 Suzuki, Akira
4 Hocquard, Hervé
4 Luo, Rong
4 Otachi, Yota
4 Paesani, Giacomo
4 Wang, Guanghui
3 Demaine, Erik D.
3 Ding, Laihao
3 Dvořák, Zdeněk
3 Lampis, Michael
3 Lévêque, Benjamin
3 Miao, Zhengke
3 Milanič, Martin
3 Mouawad, Amer E.
3 Nishimura, Naomi
3 Pierron, Théo
3 Pinlou, Alexandre
3 Seymour, Paul D.
3 Soták, Roman
3 Sun, Lei
3 Uehara, Ryuhei
3 Wang, Jihui
3 West, Douglas Brent
3 Yu, Xiaowei
2 Asplund, John
2 Bartier, Valentin
2 Belmonte, Rémy
2 Bonsma, Paul S.
2 Brettell, Nick
2 Chen, Yaojun
2 Cheng, Xiaohan
2 Chu, Ya’nan
2 Dallard, Clément
2 Defrain, Oscar
2 Esperet, Louis
2 Fan, Genghua
2 Hatanaka, Tatsuhiko
2 Heinrich, Marc
2 Hu, Xiaolan
2 Ji, Shengjin
2 Joret, Gwenaël
2 Kang, Ross J.
2 Kim, Seog-Jin
2 Kobayashi, Yusuke
2 Kwon, Ojoung
2 Li, Shuchao
2 Lu, You
2 Lv, Xia
2 Nourine, Lhouari
2 Novick, Beth
2 Osawa, Hiroki
2 Oum, Sang-Il
2 Patel, Viresh
2 Pilipczuk, Michał
2 Puleo, Gregory John
2 Qiu, Baojian
2 Rzążewski, Paweł
2 Siebertz, Sebastian
2 Škrekovski, Riste
2 Spirkl, Sophie Theresa
2 Uno, Takeaki
2 Wang, Yiqiao
2 Wasa, Kunihiro
2 Werner, Brett M.
2 Xu, Changqing
2 Yamada, Takeshi
2 Yan, Guiying
2 Yancey, Matthew P.
2 Yu, Gexin
2 Zamaraev, Victor A.
2 Zhang, Huihui
2 Zhu, Haiyang
2 Zhu, Junlei
1 Alex, Liju
1 Alon, Noga M.
1 Arimura, Hiroki
1 Axenovich, Maria A.
1 Bang-Jensen, Jørgen
1 Beisegel, Jesse
1 Bessy, Stéphane
1 Blanché, Alexandre
1 Blind, Sarah
1 Botler, Fábio
1 Briffa, Johann A.
1 Bulatović, Luka
1 Cai, Jiansheng
...and 193 more Authors

Citations by Year