765 search results - page 68 / 153 » Graph Coloring with Rejection |
Publication
We consider the colorization problem of grayscale images when some pixels, called scribbles, with initial colors are given. In this paper, we propose a new multi-layer graph model ...
ARSCOM
1999
13 years 8 months ago
1999
Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)-colorable, then any graph G with n vertices and minimum degree at least h h+1 n contains at least ...
JGT
2010
13 years 7 months ago
2010
: A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant...
JGT
2010
13 years 7 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...