RSA
2000
13 years 4 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
DAM
2010
13 years 5 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...