12 papers
On List Coloring with Separation of the Complete Graph and Set System Intersections
Jean-Christophe Godin, Rémi Grisot, Olivier Togni
We consider the following list coloring with separation problem: Given a graph and integers , find the largest integer such that for any list assignment of wit…
Leader Election And Local Identifiers For 3D Programmable Matter
Nicolas Gastineau, Wahabou Abdou, Nader Mbarek +1
In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-r…
Choosability with Separation of Cycles and Outerplanar Graphs
Jean-Christophe Godin, Olivier Togni
We consider the following list coloring with separation problem of graphs: Given a graph and integers , find the largest integer such that for any list assignment …
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…