Sciweavers

23 search results - page 2 / 5
» Hamilton cycles in random subgraphs of pseudo-random graphs
Sort
View
RSA
2000
149views more  RSA 2000»
13 years 5 months ago
Hamilton cycles in random graphs and directed graphs
Colin Cooper, Alan M. Frieze
EJC
2006
13 years 5 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
WG
2009
Springer
13 years 12 months ago
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
SIAMDM
2008
101views more  SIAMDM 2008»
13 years 5 months ago
Hamilton Cycles in Random Lifts of Directed Graphs
An n-lift of a digraph K, is a digraph with vertex set V (K)
Prasad Chebolu, Alan M. Frieze
SIAMDM
2010
102views more  SIAMDM 2010»
13 years 19 hour ago
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
Let d = d1 d2
Colin Cooper, Alan M. Frieze, Michael Krivelevich