| Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs M Bonamy, M Johnson, I Lignos, V Patel, D Paulusma Journal of Combinatorial Optimization 27 (1), 132-143, 2014 | 132* | 2014 |
| Recoloring graphs via tree decompositions M Bonamy, N Bousquet European Journal of Combinatorics 69, 200-213, 2018 | 119* | 2018 |
| Colouring graphs with sparse neighbourhoods: Bounds and applications M Bonamy, T Perrett, L Postle Journal of Combinatorial Theory, Series B 155, 278-317, 2022 | 64 | 2022 |
| Token sliding on chordal graphs M Bonamy, N Bousquet Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017 | 51 | 2017 |
| On a conjecture of Mohar concerning Kempe equivalence of regular graphs M Bonamy, N Bousquet, C Feghali, M Johnson Journal of Combinatorial Theory, Series B 135, 179-199, 2019 | 46 | 2019 |
| 2‐Distance Coloring of Sparse Graphs M Bonamy, B Lévêque, A Pinlou Journal of Graph Theory 77 (3), 190-218, 2014 | 46 | 2014 |
| Shorter labeling schemes for planar graphs M Bonamy, C Gavoille, M Pilipczuk Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 45 | 2020 |
| Independent Feedback Vertex Set for -Free Graphs M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Algorithmica 81 (4), 1342-1369, 2019 | 41 | 2019 |
| Graphs with maximum degree Δ≥ 17 and maximum average degree less than 3 are list 2-distance (Δ+ 2)-colorable M Bonamy, B Lévêque, A Pinlou Discrete Mathematics 317, 19-32, 2014 | 41 | 2014 |
| Sparse graphs with bounded induced cycle packing number have logarithmic treewidth M Bonamy, É Bonnet, H Déprés, L Esperet, C Geniet, C Hilaire, ... Journal of Combinatorial Theory, Series B 167, 215-249, 2024 | 39 | 2024 |
| Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of surfaces M Bonamy, N Bousquet, L Esperet, C Groenland, CH Liu, F Pirot, A Scott Journal of the European Mathematical Society 26 (10), 3739-3791, 2023 | 39* | 2023 |
| On the neighbor sum distinguishing index of planar graphs M Bonamy, J Przyby³o Journal of Graph Theory 85 (3), 669-690, 2017 | 37 | 2017 |
| EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs M Bonamy, É Bonnet, N Bousquet, P Charbit, P Giannopoulos, EJ Kim, ... Journal of the ACM (JACM) 68 (2), 1-38, 2021 | 30 | 2021 |
| Planar graphs of girth at least five are square (Δ+ 2)-choosable M Bonamy, DW Cranston, L Postle Journal of Combinatorial Theory, Series B 134, 218-238, 2019 | 30 | 2019 |
| Gallai’s path decomposition conjecture for graphs of small maximum degree M Bonamy, TJ Perrett Discrete Mathematics 342 (5), 1293-1299, 2019 | 29 | 2019 |
| The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019 | 29 | 2019 |
| Bounding χ by a fraction of Δ for graphs without large cliques M Bonamy, T Kelly, P Nelson, L Postle Journal of Combinatorial Theory, Series B 157, 263-282, 2022 | 28* | 2022 |
| Planar graphs with are ()-edge-choosable M Bonamy SIAM Journal on Discrete Mathematics 29 (3), 1735-1763, 2015 | 28 | 2015 |
| Graphs of bounded cliquewidth are polynomially -bounded M Bonamy, M Pilipczuk arXiv preprint arXiv:1910.00697, 2019 | 27 | 2019 |
| On directed feedback vertex set parameterized by treewidth M Bonamy, £ Kowalik, J Nederlof, M Pilipczuk, A Soca³a, M Wrochna Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018 | 27 | 2018 |
Nicolas BousquetCNRS, LIRIS, University Lyon 1, Univ. de LyonVerified email at liris.cnrs.fr
