Hamilton cycles containing randomly selected edges in random regular graphs

Random Structures and Algorithms

Volumn 19, Issue 2, 2001, Pages 128-147

  Robinson, R W ^a   Wormald, N C ^b  

^a University of Georgia ^*  (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035636763     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.1024     Document Type: Article

References (16)

1. E.A. Bender and E.R. Canfield, The asymptotic number of labeled graphs with given degree sequences, J Combin Theory Ser A 24 (1978), 296-307.
2. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J Combin 1 (1980), 311-316.
3. B. Bollobás, The asymptotic number of unlabelled regular graphs, J London Math Soc 26 (1982), 201-206.
4. B. Bollobás, Random graphs, Academic Press, London, 1985.
5. B. Bollobás and B.D. McKay, The number of matchings in random regular graphs and bipartite graphs, J Combin Theory Ser B 41 (1986), 80-91.
6. 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.
7. S. Janson, Random regular graphs: Asymptotic distributions and contiguity, Combin Probab Comput 4 (1995), 369-405.
8. B.D. McKay, E.M. Palmer, R.C. Read, and R.W. Robinson, The asymptotic number of claw-free cubic graphs, preprint.
9. B.D. McKay and N.C. Wormald, Automorphisms of random graphs with specified degrees, Combinatorica 4 (1984), 325-338.
10. M. Molloy, H. Robalewska, R.W. Robinson, and N.C. Wormald, 1-factorizations of random regular graphs, Random Struct Alg 10 (1997), 305-321.
11. R.W. Robinson and N.C. Wormald, Existence of long cycles in random cubic graphs, in Enumeration and Design, D.M. Jackson and S.A. Vanstone, Ed, Academic Press, Toronto, 1984, pp. 251-270.
12. R.W. Robinson and N.C. Wormald, Almost all cubic graphs are Hamiltonian, Random Struct Alg 3 (1992), 117-125.
13. R.W. Robinson and N.C. Wormald, Almost all regular graphs are Hamiltonian, Random Struct Alg 5 (1994), 363-374.
14. N.C. Wormald, A simpler proof of the asymptotic formula for unlabelled r-regular graphs, Indian J Math 28 (1986), 43-47.
15. N.C. Wormald, Models of random regular graphs, Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series 267 J.D. Lamb and D.A. Preece, Eds, Cambridge University Press, Cambridge, 1999, pp. 239-298.
16. N.C. Wormald, Models of random regular graphs, Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series 267 J.D. Lamb and D.A. Preece, Eds, Cambridge University Press, Cambridge, 1999, pp. 239-298.