author-photo

Marthe Bonamy

University of Bordeaux
University of Montpellier
L'Abri

145

Papers

843

Citations

Citation Trend

Filter By

Papers (145) Sort By

Journal Conference Others

Bounding χ by a fraction of Δ for graphs without large cliques.

2022 J. Comb. Theory, Ser. B
Show All
- Source
- Cite
- Save
Citations (0)
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs

2022 Journal of Combinatorial Theory, Series B
Show All
- Source
- Cite
- Save
Citations (3)
Improved pyrotechnics : Closer to the burning graph conjecture.

2021 arXiv: Combinatorics
Show All
- Source
- Cite
- Save
Citations (1)
A note on deterministic zombies

2021 Discrete Applied Mathematics
Show All
- Source
- Cite
- Save
Citations (0)
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs.

2021 DISC | International Conference on Distributed Computing
Show All
- Source
- Cite
- Save
Citations (0)
On Vizing's edge colouring question.

2021 arXiv: Combinatorics
Show All
- Source
- Cite
- Save
Citations (0)
A tight local algorithm for the minimum dominating set problem in outerplanar graphs.

2021 arXiv: Distributed, Parallel, and Cluster Computing
Show All
- Source
- Cite
- Save
Citations (0)
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.

2021 arXiv: Data Structures and Algorithms
Show All
- Source
- Cite
- Save
Citations (0)
Decomposing the edges of a graph into simpler structures

2021
- Marthe Bonamy
Show All
- Source
- Cite
- Save
Citations (0)
Optimal labelling schemes for adjacency

2021 STOC | Symposium on the Theory of Computing
Show All
- Source
- Cite
- Save
Citations (0)