In a previous paper the authors showed that almost all labelled cubic graphs are hamiltonian. In the present paper, this result is used to show that almost all r-regular graphs are hamiltonian for any fixed r ≥ 3, by an analysis of the distribution of 1-factors in random regular graphs. Moreover, almost all such graphs are r-edge-colourable if they have an even number of vertices. Similarly, al...