172
click to vote
APPROX
2006
Springer
15 years 10 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...
171
Voted
WAW
2004
Springer
16 years 10 hour ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
170
click to vote
WAW
2007
Springer
16 years 23 days ago
2007
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...