325 search results - page 1 / 65 » Hamilton cycles in random graphs and directed graphs |
RSA
2000
13 years 7 months ago
2000
SIAMDM
2008
13 years 7 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
