-
Tree depth, subgraph coloring and homomorphism bounds
We define the notions tree depth and upper chromatic number of a graph and show their relevance to local - global problems for graphs partitions. Particularly we show... -
Folding
We define folding of a directed graph as a coloring (or a homomorphism) which is injective on all the down sets of a given depth. While in general foldings are as... -
Application of Homomorphism to Secure Image Sharing
International audience -
Complex dimension of additive subgroups of R^{n}
In this paper, we define the complex dimension of any additive subgroup of R^{n}$which generalize the euclidien dimension given for the vector space. We give an... -
Homomorphisms of planar signed graphs to signed projective cubes
International audience -
Homomorphisms of signed graphs
International audience
