23 search results - page 1 / 5 » Hamilton cycles in random subgraphs of pseudo-random graphs |
DM
2002
13 years 4 months ago
2002
CORR
2011
Springer
12 years 11 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...
Book
A classic book on graph theory.
Book
A well-written book about graph theory.
EJC
2006
13 years 4 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)