Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs

Journal of Combinatorial Theory. Series B

Volumn 81, Issue 1, 2001, Pages 20-44

  Kim, Jeong Han ^a   Wormald, Nicholas C ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012877456     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1991     Document Type: Article

References (11)

1. B. Bollobás, "Random Graphs," Academic Press, London, 1985.
2. A. Frieze, M. Jerrum, M. Molloy, R. W. Robinson, and N. C. Wormald, Generating and counting Hamilton cycles in random regular graphs, J. Algorithms 21 (1996), 176-198.
3. G. R. Grimmett and D. R. Stirzaker, "Probability and Random Processes," 2nd ed., Clarendon, Oxford, 1992.
4. S. Janson, Random regular graphs: Asymptotic distributions and contiguity, Combin. Probab. Comput. 4 (1995), 1-37.
5. C. McDiarmid, On the method of bounded differences, in "Surveys in Combinatorics, 1989" (J. Siemons, Ed.), pp. 148-188, 1989.
6. M. Molloy, H. Robalewska, R. W. Robinson, and N. C. Wormald, 1-factorisations of random regular graphs, Random Structures Algorithms 10 (1997), 305-321.
7. H. Robalewska, 2-factors in random regular graphs, J. Graph Theory 23 (1996), 215-224.
8. R. W. Robinson and N. C. Wormald, Almost all cubic graphs are hamiltonian, Random Structures Algorithms 3 (1992), 117-125.
9. R. W. Robinson and N. C. Wormald, Almost all regular graphs are hamiltonian, Random Structures Algorithms 5 (1994), 363-374.
10. A. Steger and N. C. Wormald, Generating random regular graphs quickly, Combin. Probab. Comput. 8 (1999), 377-396.
11. N. C. Wormald, Models of random regular graphs, in "Surveys in Combinatorics, 1999" (J. D. Lamb and D. A. Preece, Eds.), London Mathematical Society Lecture Note Series, Vol. 267, pp. 239-298, Cambridge University Press, Cambridge, UK, 1999.