| The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem L Esperet, U Giocanti, C Legrand-Duchesne Journal of Combinatorial Theory, Series B 169, 561-613, 2024 | 9 | 2024 |
| Strengthening a theorem of Meyniel Q Deschamps, C Feghali, F Kardoš, C Legrand-Duchesne, T Pierron SIAM Journal on Discrete Mathematics 37 (2), 604-611, 2023 | 7 | 2023 |
| Kempe changes in degenerate graphs M Bonamy, V Delecroix, C Legrand–Duchesne European Journal of Combinatorics 119, 103802, 2024 | 6 | 2024 |
| On a recolouring version of Hadwiger's conjecture M Bonamy, M Heinrich, C Legrand-Duchesne, J Narboni Journal of Combinatorial Theory, Series B 164, 364-370, 2024 | 6 | 2024 |
| Minimum separator reconfiguration GCM Gomes, C Legrand-Duchesne, R Mahmoud, AE Mouawad, ... Journal of Computer and System Sciences 146, 103574, 2024 | 2 | 2024 |
| Parameterized complexity of untangling knots C Legrand-Duchesne, A Rai, M Tancer SIAM Journal on Computing 53 (2), 431-479, 2024 | 1 | 2024 |
| Minimum separator reconfiguration G CM Gomes, C Legrand-Duchesne, R Mahmoud, AE Mouawad, ... | | 2024 |
| Random embeddings of bounded degree trees with optimal spread P Bastide, C Legrand-Duchesne, A Müyesser arXiv preprint arXiv:2409.06640, 2024 | | 2024 |
| Exploration of the space of the colorings of a graph C Legrand-Duchesne Université de Bordeaux, 2024 | | 2024 |
| Graph recoloring with Kempe changes C Legrand-Duchesne | | 2021 |
| Kempe Changes in Bounded Treewidth Graphs M Bonamy, V Delecroix, C Legrand-Duchesne Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | | 2021 |
| Potential NP-completeness of an approximate tree compression problem C Legrand-Duchesne | | 2018 |
| Parameterized complexity of a knot theory problem C Legrand-Duchesne | | |
Marthe BonamyLaBRI, CNRS, Université BordeauxVerified email at u-bordeaux.fr
