3211 search results - page 3 / 643 » On the Grundy Number of a Graph |
SIAMDM
2010
13 years 2 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
COMBINATORICA
2011
12 years 7 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...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
GC
2011
Springer
13 years 2 months ago
2011
Springer
TIT
2011
13 years 2 months ago
2011
