Quentin Deschamps

activity

20212025

most citedSquare coloring planar graphs with automatic discharging

3 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Improved square coloring of planar graphs

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer +1

Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner,…

math.CO2021

Locating-dominating sets: from graphs to oriented graphs

Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä +1

A locating-dominating set in an undirected graph is a subset of vertices $S$ such that $S$ is dominating and for every $u, v \in / S$ , we have $N (u) \cap S \neq = N (v) \cap S$ . In this p…

math.CO2021

Metric dimension on sparse graphs and its applications to zero forcing sets

Nicolas Bousquet, Quentin Deschamps, Aline Parreau +1

The metric dimension dim(G) of a graph $G$ is the minimum cardinality of a subset $S$ of vertices of $G$ such that each vertex of $G$ is uniquely determined by its distances to $S$ …