19 citations · 19 across the 8 of their papers we have counts for
14 papers
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…
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…
On S-packing edge-colorings of cubic graphs
Nicolas Gastineau, Olivier Togni
Given a non-decreasing sequence S = (s 1,s 2,. .. ,s k) of positive integers, an S-packing edge-coloring of a graph G is a partition of the edge set of G into k subsets {X 1 ,X 2,.…
On packing chromatic number of subcubic outerplanar graphs
Nicolas Gastineau, P{ř}emysl Holub, Olivier Togni
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number i…
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
Benoit Darties, Nicolas Gastineau, Olivier Togni
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently compl…
Subdivision into i-packings and S-packing chromatic number of some lattices
Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni
An -packing in a graph is a set of vertices at pairwise distance greater than . For a nondecreasing sequence of integers , the -packing chrom…
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
Brice Effantin, Nicolas Gastineau, Olivier Togni
Gy{á}rf{á}s et al. and Zaker have proven that the Grundy number of a graph satisfies if and only if contains an induced subgraph called a -atom.The family of…
Completely Independent Spanning Trees in Some Regular Graphs
Benoit Darties, Nicolas Gastineau, Olivier Togni
Let be an integer and be spanning trees of a graph . If for any pair of vertices of , the paths from to in each , $1\le i\l…
S-Packing Colorings of Cubic Graphs
Nicolas Gastineau, Olivier Togni
Given a non-decreasing sequence of positive integers, an {\em -packing coloring} of a graph is a mapping from to $\{s\_1,s\_2, \ldot…
On the family of -regular graphs with Grundy number
Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni
The Grundy number of a graph , denoted by , is the largest such that there exists a partition of , into independent sets and every vertex o…
Dichotomies properties on computational complexity of S-packing coloring problems
Nicolas Gastineau
This work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s\…