173 search results - page 7 / 35 » Every color chromakey |
RSA
2000
14 years 11 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
MVA
2007
15 years 1 months ago
2007
We propose a method to stabilize illumination color estimation by using the idea of an “Illumination line segment”. It is a finite line where every illumination color exists ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
DM
2010
14 years 12 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...