22 search results - page 1 / 5 » Hamilton Cycles in Random Lifts of Directed Graphs |
100
Voted
SIAMDM
2008
15 years 2 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
111
Voted
EJC
2006
15 years 2 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
104
Voted
RSA
2000
15 years 2 months ago
2000
113
Voted
CORR
2011
Springer
14 years 9 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...
313
Voted
Book
A well-written book about graph theory.