22 search results - page 2 / 5 » Hamilton Cycles in Random Lifts of Directed Graphs |
Book
A classic book on graph theory.
DM
2002
13 years 6 months ago
2002
SIAMDM
2010
13 years 1 months ago
2010
Let d = d1 d2
RSA
2010
13 years 5 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...
ARSCOM
2004
13 years 6 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...