Nicolas Bousquet

activity

20232026

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Shallow brambles

Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet +2

A graph class $C$ has polynomial expansion if there is a polynomial function $f$ such that for every graph $G \in C$ , each of the depth- $r$ minors of $G$ has ave…

math.CO2024

A note on locating-dominating sets in twin-free graphs

Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry +2

In this short note, we prove that every twin-free graph on $n$ vertices contains a locating-dominating set of size at most $⌈ \frac{5}{8} n ⌉$ . This improves the earlier bou…

math.CO2024

A Note on the Complexity of Graph Recoloring

Nicolas Bousquet

We say that a graph is $k$ -mixing if it is possible to transform any $k$ -coloring into any other via a sequence of single vertex recolorings keeping a proper coloring all along. Ce…