Sciweavers

325 search results - page 2 / 65
» Hamilton cycles in random graphs and directed graphs
Sort
View
EJC
2006
13 years 7 months ago
Hamilton cycles in random lifts of graphs
An n-lift of a graph K, is a graph with vertex set V (K)
K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. F...
DM
2002
78views more  DM 2002»
13 years 7 months ago
Hamilton cycles in random subgraphs of pseudo-random graphs
Alan M. Frieze, Michael Krivelevich
SIAMDM
2010
102views more  SIAMDM 2010»
13 years 2 months ago
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
Let d = d1 d2
Colin Cooper, Alan M. Frieze, Michael Krivelevich
RSA
2010
99views more  RSA 2010»
13 years 5 months ago
Hamiltonicity thresholds in Achlioptas processes
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...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
ARSCOM
2004
104views more  ARSCOM 2004»
13 years 7 months ago
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
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...
Klas Markstrom