Подписаться
Marthe Bonamy
Marthe Bonamy
LaBRI, CNRS, Université Bordeaux
Подтвержден адрес электронной почты в домене u-bordeaux.fr - Главная страница
Название
Процитировано
Процитировано
Год
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
128*2014
Recoloring graphs via tree decompositions
M Bonamy, N Bousquet
European Journal of Combinatorics 69, 200-213, 2018
117*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
632022
2‐Distance Coloring of Sparse Graphs
M Bonamy, B Lévêque, A Pinlou
Journal of Graph Theory 77 (3), 190-218, 2014
472014
Token sliding on chordal graphs
M Bonamy, N Bousquet
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
462017
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
452019
Shorter labeling schemes for planar graphs
M Bonamy, C Gavoille, M Pilipczuk
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
422020
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
422014
Independent Feedback Vertex Set for -Free Graphs
M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Algorithmica 81 (4), 1342-1369, 2019
402019
On the neighbor sum distinguishing index of planar graphs
M Bonamy, J Przybyło
Journal of Graph Theory 85 (3), 669-690, 2017
372017
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
352024
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
34*2023
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
302019
Gallai’s path decomposition conjecture for graphs of small maximum degree
M Bonamy, TJ Perrett
Discrete Mathematics 342 (5), 1293-1299, 2019
282019
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
282019
Graphs with large chromatic number induce -cycles
M Bonamy, P Charbit, S Thomassé
arXiv preprint arXiv:1408.2172, 2014
282014
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
272021
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
272018
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
272016
Graphs of bounded cliquewidth are polynomially -bounded
M Bonamy, M Pilipczuk
arXiv preprint arXiv:1910.00697, 2019
262019
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20