… c(v) for all v ¾ V (G) is a local coloring of G as well. On occasion we will refer to the following
three results … For a graph G with χ¿(G) = , we say that a minimum local coloring c of G is a …

… literature on those variants of the chromatic number problem where not only a proper coloring
… ) but some further local restrictions are imposed on the color assignment. Mostly, the list …

… In this paper we improve upon the bounds for the problem of local coloring. Using a new
characterization in terms of a family of set systems we design a randomized algorithm for the …

… The k-local coloring of graphs for k = 3 was discussed in [2] and [3]. A 3-local coloring c of a
graph G is referred to as a local coloring … by χl(G) which is also referred to as local chromatic …

… For example, it is true [4] that for every graph G, the local … that for every local k-coloring of the
complete graph on t vertices, … many graphs G the usual Ramsey number rk(G) and the local …

… colors but impose some local restrictions on the colorings. We say that a coloring of a graph
F (throughout the note all colorings are edgecolorings) is r-local if at most r colors occur on …

… Our bound uses a graph theoretic quantity called the local chromatic number. We show
how a good local coloring can be used to create a good index code. The local coloring is used …

… Let c 1 and c 2 be local colorings of graphs G and H of value s 1 and s 2 , respectively. We
define a local coloring c of graph G ∨ H of value s 1 + s 2 + 1 as … On local colorings of graphs …

… the Lovász Local Lemma hold for the dependency graph G with … on G , so that its logarithm
is the pressure of such a gas. From this, Scott and Sokal could conclude that the Lovász Local …

… To conclude, we observe that almost all efficient heuristic algorithms for graph coloring use
a local search, and many of them are based on a tabu search. In particular, Tabucol is very …