1749 search results - page 3 / 350 » Conditional colorings of graphs |
CIAC
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
GC
2008
Springer
13 years 6 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
ICPR
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper describes an online learning method of color transformation for interactive object recognition. In order to recognize objects under various lighting conditions, the sys...
FOCS
2007
IEEE
14 years 17 days ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
SIAMDM
2010
13 years 4 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...