27 search results - page 1 / 6 » Coloring Geographical Threshold Graphs |
DMTCS
2010
13 years 2 months ago
2010
WAW
2007
Springer
13 years 11 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
IM
2008
13 years 4 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
COMBINATORICS
2000
13 years 4 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...