Bonamy, Marthe; Heinrich, Marc; Legrand-Duchesne, Clément; Narboni, Jonathan On a recolouring version of Hadwiger’s conjecture. (English) Zbl 07796421 J. Comb. Theory, Ser. B 164, 364-370 (2024). MSC: 05C15 05C35 05C10 05C83 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 164, 364--370 (2024; Zbl 07796421) Full Text: DOI arXiv
Bonamy, Marthe; Delcourt, Michelle; Lang, Richard; Postle, Luke Edge-colouring graphs with local list sizes. (English) Zbl 07787804 J. Comb. Theory, Ser. B 165, 68-96 (2024). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 165, 68--96 (2024; Zbl 07787804) Full Text: DOI arXiv
Bonamy, Marthe; Pierron, Théo; Sopena, Éric Every planar graph with \(\Delta \geqslant 8\) is totally \((\Delta +2)\)-choosable. (English) Zbl 1522.05058 J. Graph Theory 104, No. 1, 17-86 (2023). Reviewer: Juanjo Rué Perna (Barcelona) MSC: 05C10 05C15 05C07 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Graph Theory 104, No. 1, 17--86 (2023; Zbl 1522.05058) Full Text: DOI arXiv
Bonamy, Marthe; Defrain, Oscar; Klimošová, Tereza; Lagoutte, Aurélie; Narboni, Jonathan On Vizing’s edge colouring question. (English) Zbl 1506.05060 J. Comb. Theory, Ser. B 159, 126-139 (2023). Reviewer: Nicolás Sanhueza-Matamala (Praha) MSC: 05C15 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 159, 126--139 (2023; Zbl 1506.05060) Full Text: DOI arXiv
Bonamy, Marthe; Kelly, Tom; Nelson, Peter; Postle, Luke Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques. (English) Zbl 1497.05068 J. Comb. Theory, Ser. B 157, 263-282 (2022). MSC: 05C15 05C85 05D40 60C05 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 157, 263--282 (2022; Zbl 1497.05068) Full Text: DOI arXiv
Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał Shorter labeling schemes for planar graphs. (English) Zbl 07589616 SIAM J. Discrete Math. 36, No. 3, 2082-2099 (2022). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{M. Bonamy} et al., SIAM J. Discrete Math. 36, No. 3, 2082--2099 (2022; Zbl 07589616) Full Text: DOI
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. (English) Zbl 1522.05362 J. Graph Theory 98, No. 1, 81-109 (2021). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Graph Theory 98, No. 1, 81--109 (2021; Zbl 1522.05362) Full Text: DOI arXiv OA License
Bonamy, Marthe; Dorbec, Paul; Ouvrard, Paul Dominating sets reconfiguration under token sliding. (English) Zbl 1466.05158 Discrete Appl. Math. 301, 6-18 (2021). MSC: 05C69 68R10 68Q17 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Discrete Appl. Math. 301, 6--18 (2021; Zbl 1466.05158) Full Text: DOI arXiv HAL
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. (English) Zbl 1512.68195 Algorithmica 83, No. 3, 822-852 (2021). MSC: 68R10 05C60 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 83, No. 3, 822--852 (2021; Zbl 1512.68195) Full Text: DOI arXiv
Bonamy, Marthe; Heinrich, Marc; Ito, Takehiro; Kobayashi, Yusuke; Mizuta, Haruka; Mühlenthaler, Moritz; Suzuki, Akira; Wasa, Kunihiro Diameter of colorings under Kempe changes. (English) Zbl 1456.05056 Theor. Comput. Sci. 838, 45-57 (2020). MSC: 05C15 05C85 68Q17 05C76 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Theor. Comput. Sci. 838, 45--57 (2020; Zbl 1456.05056) Full Text: DOI
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Independent feedback vertex set for \(P_5\)-free graphs. (English) Zbl 1422.68105 Algorithmica 81, No. 4, 1342-1369 (2019). MSC: 68Q25 05C69 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 81, No. 4, 1342--1369 (2019; Zbl 1422.68105) Full Text: DOI arXiv
Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew On a conjecture of Mohar concerning Kempe equivalence of regular graphs. (English) Zbl 1404.05049 J. Comb. Theory, Ser. B 135, 179-199 (2019). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 135, 179--199 (2019; Zbl 1404.05049) Full Text: DOI arXiv Link
Bonamy, Marthe; Cranston, Daniel W.; Postle, Luke Planar graphs of girth at least five are square \((\delta + 2)\)-choosable. (English) Zbl 1402.05043 J. Comb. Theory, Ser. B 134, 218-238 (2019). MSC: 05C10 05C15 05C07 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 134, 218--238 (2019; Zbl 1402.05043) Full Text: DOI arXiv
Bonamy, Marthe; Ouvrard, Paul; Rabie, Mikaël; Suomela, Jukka; Uitto, Jara Distributed recoloring. (English) Zbl 1497.68369 Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 12, 17 p. (2018). MSC: 68R10 05C15 05C85 68M10 68Q10 68W15 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 121, Article 12, 17 p. (2018; Zbl 1497.68369) Full Text: DOI arXiv
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Independent feedback vertex sets for graphs of bounded diameter. (English) Zbl 1422.68104 Inf. Process. Lett. 131, 26-32 (2018). MSC: 68Q25 05C69 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Inf. Process. Lett. 131, 26--32 (2018; Zbl 1422.68104) Full Text: DOI arXiv
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Independent feedback vertex set for \(P_5\)-free graphs. (English) Zbl 1457.68122 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 16, 12 p. (2017). MSC: 68Q25 05C05 05C69 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 16, 12 p. (2017; Zbl 1457.68122) Full Text: DOI
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin Tight lower bounds for the complexity of multicoloring. (English) Zbl 1434.68186 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 18, 14 p. (2017). MSC: 68Q17 05C15 05C60 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 18, 14 p. (2017; Zbl 1434.68186) Full Text: DOI arXiv
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Recognizing graphs close to bipartite graphs. (English) Zbl 1441.68167 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 70, 14 p. (2017). MSC: 68R10 05C15 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 70, 14 p. (2017; Zbl 1441.68167) Full Text: DOI
Bonamy, Marthe; Meeks, Kitty The interactive sum choice number of graphs. (English) Zbl 1378.05045 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 139-145 (2017). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Bonamy} and \textit{K. Meeks}, Electron. Notes Discrete Math. 61, 139--145 (2017; Zbl 1378.05045) Full Text: DOI arXiv Link
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz Linear kernels for outbranching problems in sparse digraphs. (English) Zbl 1378.68063 Algorithmica 79, No. 1, 159-188 (2017). MSC: 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 79, No. 1, 159--188 (2017; Zbl 1378.68063) Full Text: DOI
Bonamy, M.; Przybyło, J. On the neighbor sum distinguishing index of planar graphs. (English) Zbl 1367.05066 J. Graph Theory 85, No. 3, 669-690 (2017). MSC: 05C15 05C10 05C07 PDFBibTeX XMLCite \textit{M. Bonamy} and \textit{J. Przybyło}, J. Graph Theory 85, No. 3, 669--690 (2017; Zbl 1367.05066) Full Text: DOI arXiv
Bonamy, Marthe; Hocquard, Hervé; Kerdjoudj, Samia; Raspaud, André Incidence coloring of graphs with high maximum average degree. (English) Zbl 1365.05083 Discrete Appl. Math. 227, 29-43 (2017). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Discrete Appl. Math. 227, 29--43 (2017; Zbl 1365.05083) Full Text: DOI arXiv
Bonamy, Marthe Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable. (English) Zbl 1321.05061 SIAM J. Discrete Math. 29, No. 3, 1735-1763 (2015). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{M. Bonamy}, SIAM J. Discrete Math. 29, No. 3, 1735--1763 (2015; Zbl 1321.05061) Full Text: DOI
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre 2-distance coloring of sparse graphs. (English) Zbl 1304.05042 J. Graph Theory 77, No. 3, 190-218 (2014). Reviewer: Václav Koubek (Praha) MSC: 05C15 05C10 05C42 05C85 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Graph Theory 77, No. 3, 190--218 (2014; Zbl 1304.05042) Full Text: DOI Link
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre List coloring the square of sparse graphs with large degree. (English) Zbl 1300.05090 Eur. J. Comb. 41, 128-137 (2014). MSC: 05C15 05C42 05C07 05C35 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Eur. J. Comb. 41, 128--137 (2014; Zbl 1300.05090) Full Text: DOI arXiv