720 search results - page 101 / 144 » Nonrepetitive colorings of graphs |
ICIAP
2003
ACM
14 years 7 months ago
2003
ACM
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determine...
DAM
2008
13 years 7 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
JCT
2006
13 years 7 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
PR
2006
13 years 7 months ago
2006
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...
SIAMDM
2008
13 years 7 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...