38 citations · 61 across the 21 of their papers we have counts for
5 papers · 1 filter
New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's Conjecture (extended version)
Jean-Christophe Godin, Olivier Togni
A -coloring of a graph associates to each vertex a -subset of a set of colors in such a way that the color-sets of adjacent vertices are disjoint. We define gener…
Exact distance graphs of product graphs
Boštjan Brešar, Nicolas Gastineau, Sandi Klavžar +1
Given a graph , the exact distance- graph has as its vertex set, and two vertices are adjacent whenever the distance between them in equals .…
Packing colorings of subcubic outerplanar graphs
Boštjan Brešar, Nicolas Gastineau, Olivier Togni
Given a graph and a nondecreasing sequence of positive integers, the mapping is called an -packing coloring of $G…
Distributed leader election and computation of local identifiers for programmable matter
Nicolas Gastineau, Wahabou Abdou, Nader Mbarek +1
The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the…
Coloring of the dth power of the face-centered cubic grid
Nicolas Gastineau, Olivier Togni
The face-centered cubic grid is a three dimensional 12-regular infinite grid. This graph represents an optimal way to pack spheres in the three-dimensional space. In this grid, the…