11 search results - page 2 / 3 » Hamilton cycles in random lifts of graphs |
DM
2002
13 years 5 months ago
2002
SIAMDM
2010
13 years 12 hour ago
2010
Let d = d1 d2
RSA
2010
13 years 3 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
CPC
2010
13 years 2 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
RSA
2002
13 years 4 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...