Sciweavers

Share
RSA
2000
98views more  RSA 2000»
9 years 6 months ago
Degrees and choice numbers
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...
Noga Alon
DAM
2010
103views more  DAM 2010»
9 years 7 months ago
Dynamic list coloring of bipartite graphs
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...
Louis Esperet
books