617 search results - page 45 / 124 » On the Chromatic Number of Random Graphs |
103
click to vote
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
ENDM
2007
14 years 11 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
102
click to vote
DM
2010
14 years 12 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
114
click to vote
VIS
2004
IEEE
16 years 1 months ago
2004
IEEE
Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results fr...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...