| 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 | 110* | 2014 |
| Recoloring graphs via tree decompositions M Bonamy, N Bousquet European Journal of Combinatorics 69, 200-213, 2018 | 93* | 2018 |
| 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 |
| 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 | 37 | 2019 |
| Token sliding on chordal graphs M Bonamy, N Bousquet Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017 | 37 | 2017 |
| Colouring graphs with sparse neighbourhoods: Bounds and applications M Bonamy, T Perrett, L Postle arXiv preprint arXiv:1810.06704, 2018 | 35 | 2018 |
| On the neighbor sum distinguishing index of planar graphs M Bonamy, J Przybyło Journal of Graph Theory 85 (3), 669-690, 2017 | 35 | 2017 |
| 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 | 35 | 2014 |
| Independent Feedback Vertex Set for -Free Graphs M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Algorithmica 81 (4), 1342-1369, 2019 | 33 | 2019 |
| Shorter labeling schemes for planar graphs M Bonamy, C Gavoille, M Pilipczuk Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 29 | 2020 |
| 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 | 24 | 2019 |
| The Erdös--Hajnal Conjecture for Long Holes and Antiholes M Bonamy, N Bousquet, S Thomassé SIAM Journal on Discrete Mathematics 30 (2), 1159-1164, 2016 | 24 | 2016 |
| Planar graphs with are ()-edge-choosable M Bonamy SIAM Journal on Discrete Mathematics 29 (3), 1735-1763, 2015 | 23 | 2015 |
| Reconfiguring independent sets in cographs M Bonamy, N Bousquet arXiv preprint arXiv:1406.1433, 2014 | 23 | 2014 |
| Graphs with large chromatic number induce -cycles M Bonamy, P Charbit, S Thomassé arXiv preprint arXiv:1408.2172, 2014 | 22 | 2014 |
| Adjacent vertex-distinguishing edge coloring of graphs M Bonamy, N Bousquet, H Hocquard The Seventh European Conference on Combinatorics, Graph Theory and …, 2013 | 22 | 2013 |
| Graphs of bounded cliquewidth are polynomially -bounded M Bonamy, M Pilipczuk arXiv preprint arXiv:1910.00697, 2019 | 20 | 2019 |
| Gallai’s path decomposition conjecture for graphs of small maximum degree M Bonamy, TJ Perrett Discrete Mathematics 342 (5), 1293-1299, 2019 | 19 | 2019 |
| The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019 | 19 | 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 | 19 | 2018 |
Nicolas BousquetCNRS, LIRIS, University Lyon 1, Univ. de LyonVerified email at liris.cnrs.fr
