Nicolas Gastineau

activity

20132020

most citedPacking colorings of subcubic outerplanar graphs

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

collaborators

Showing 2013Show all

2 papers · 1 filter

cs.DM2013

On the family of $r$ -regular graphs with Grundy number $r + 1$

Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni

The Grundy number of a graph $G$ , denoted by $Γ (G)$ , is the largest $k$ such that there exists a partition of $V (G)$ , into $k$ independent sets $V_{1}, \dots, V_{k}$ and every vertex o…

cs.DM2013

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\…

On the family of r-regular graphs with Grundy number r+1

Dichotomies properties on computational complexity of S-packing coloring problems

On the family of $r$ -regular graphs with Grundy number $r + 1$