In this paper we are concerned with the so-called clique-colorations of a graph, that is,
colorations of the vertices so that no maximal clique is monochromatic. On one hand, it is known …

We show that every nonstable graph (possibly infinite) with bounded degree admits a set
V⧹{x} as an identifying code. We know some infinite graphs for which only its vertex set itself …

Dans la première partie, nous étudions la notion de coloration par listes. Un graphe d'ordre
n est k-liste colorable si, quelque soit la donnée de n listes de taille k (une par sommet), il est …

… Gravier, S. Klavzar and M. Mollard, Codes and L(2, 1)-labelings in Sierpinski graphs,
Taiwanese J. … Sylvain Gravier, Fédération de recherche Maths `a Modeler, Also with …

We prove that there does not exist a tiling with Lee spheres of radius at least 2 in the 3-
dimensional Euclidean space. In particular, this result verifies a conjecture of Golomb and …

We use the link between the existence of tilings in Manhattan metric with {1}-bowls and
minimum total dominating sets of Cartesian products of paths and cycles. From the existence of …

We consider the problem of coloring the vertices of a graph so that no maximal clique of size
at least two is monocolored. We solve the following question: Given a fixed graph F, does …

… Sylvain Gravier et ξ2 la co-directrice de thèse Cécile Ouvrier-Buffet, le symbole Q désignant
l’ensemble de questions – éventuellement réduit à une question – sur lequel a porté le …

In this paper we are interested in the Pentomino Exclusion Problem due to Golomb: Find the
minimum number of unit squares to be placed on a k\times n chessboard so as to exclude …

In this paper we deal with identifying codes in cycles. We show that for all r≥1, any r-identifying
code of the cycle C n has cardinality at least gcd(2r+1,n)⌈n2gcd(2r+1,n)⌉. This lower …