4171 search results - page 1 / 835 » Choice numbers of graphs |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
COMBINATORICS
2002
13 years 4 months ago
2002
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
JCT
2006
13 years 4 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
COMBINATORICA
2011
12 years 4 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...