Generating and Counting Hamilton Cycles in Random Regular Graphs

Journal of Algorithms

Volumn 21, Issue 1, 1996, Pages 176-198

  Frieze, Alan ^a   Jerrum, Mark ^b   Molloy, Michael ^a   Robinson, Robert ^c   Wormald, Nicholas ^d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c University of Georgia ^*  (United States)

^d UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLE(GRAPH); HAMILTONIAN CYCLE; POLYNOMIAL TIME; RANDOM GRAPH; REGULAR GRAPH; VERTEX(GRAPH);

ALGORITHMS;

GRAPH THEORY;

EID: 0030371597     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0042     Document Type: Article

References (15)

1. E. A. Bender and E. R. Canfield, The asymptotic number of labelled graphs with given degree sequences, J. Combin. Theory Ser. A 24 (1978), 296-307.
2. B. Bollobás, Almost all regular graphs are Hamiltonian, European J. Combin. 4 (1983), 97-106.
3. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combin. 1 (1980), 311-316.
4. A. Broder, A. M. Frieze, and E. Shamir, Finding hidden Hamilton cycles, Random Structures Algorithms 5 (1994), 395-410.
5. T. I. Fenner and A. M. Frieze, Hamiltonian cycles in random regular graphs, J. Combin. Theory Ser. B (1984), 103-112.
6. A. M. Frieze, Finding Hamilton cycles in sparse random graphs, J. Combin. Theory Ser. B 44 (1988), 230-250.
7. C. Cooper, A. M. Frieze, and M. J. Molloy, Hamilton cycles in random regular digraphs, Combin. Probab. Comput. 3 (1994), 39-50.
8. S. Janson, Random regular graphs: Asymptotic distributions and contiguity, to appear.
9. M. R. Jerrum and A. J. Sinclair, Approximating the permanent, SIAM J. Comput. 18 (1989), 1149-1178.
10. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci. 43 (1986), 169-188.
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, Eds.) pp. 251-270, Academic Press, Toronto, 1984.
12. R. W. Robinson and N. C. Wormald, Almost all cubic graphs are Hamiltonian, Random Structures Algorithms 3 (1992), 117-126.
13. R. W. Robinson and N. C. Wormald, Almost all regular graphs are Hamiltonian, Random Structures Algorithms 5 (1994), 363-374.
14. C. P. Schnorr, Optimal algorithms for self-reducible problems, in "Proceedings of the Third International Colloquium on Automata, Languages and Programming, 1976, pp. 322-337.
15. W. T. Tutte, A short proof of the factor theorem for finite graphs, Canad. J. Math. 6 (1954), 347-352.