720 search results - page 67 / 144 » Nonrepetitive colorings of graphs |
JGT
2008
14 years 12 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
102
click to vote
DAM
2007
14 years 12 months ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
103
Voted
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
14 years 11 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 ...