Sciweavers

4171 search results - page 1 / 835
» Choice numbers of graphs
Sort
View
41
Voted
CORR
2008
Springer
101views Education» more  CORR 2008»
14 years 10 months ago
Choice numbers of graphs
Shai Gutner
RSA
2000
98views more  RSA 2000»
14 years 9 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
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
14 years 9 months ago
Sum List Coloring 2*n Arrays
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...
Garth Isaak
JCT
2006
168views more  JCT 2006»
14 years 9 months ago
Mono-multi bipartite Ramsey numbers, designs, and matrices
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....
Paul N. Balister, András Gyárf&aacut...
COMBINATORICA
2011
13 years 9 months ago
On the chromatic number of random geometric graphs
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...
Colin McDiarmid, Tobias Müller