11 search results - page 1 / 3 » Hamilton cycles in random lifts of graphs |
69
Voted
EJC
2006
14 years 10 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
SIAMDM
2008
14 years 10 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
CORR
2011
Springer
14 years 5 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...
RSA
2000
14 years 10 months ago
2000
