Date of Original Version
This is the accepted version of the article which has been published in final form at http://dx.doi.org/10.1002/rsa.20482
Abstract or Description
We describe and analyse a simple greedy algorithm 2greedy that finds a good 2-matching M in the random graph when . A 2-matching is a spanning subgraph of maximum degree two and G is drawn uniformly from graphs with vertex set , cn edges and minimum degree at least three. By good we mean that M has components. We then use this 2-matching to build a Hamilton cycle in time w.h.p.
Random Structures and Algorithms, 45, 3, 443-497.