메뉴 건너뛰기




Volumn 15, Issue 1, 1999, Pages 43-92

The asymptotic distribution of long cycles in random regular graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0033450661     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199908)15:1<43::AID-RSA3>3.0.CO;2-S     Document Type: Article
Times cited : (20)

References (11)
  • 1
    • 0000664045 scopus 로고
    • The asymptotic number of labelled graphs with given degree sequences
    • E.A. Bender and E.R. Canfield, The asymptotic number of labelled graphs with given degree sequences, J Comb Theor A 24 (1978), 296-307.
    • (1978) J Comb Theor A , vol.24 , pp. 296-307
    • Bender, E.A.1    Canfield, E.R.2
  • 2
    • 85012603843 scopus 로고
    • A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
    • B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Eur J Combin 1 (1980), 311-316.
    • (1980) Eur J Combin , vol.1 , pp. 311-316
    • Bollobás, B.1
  • 4
    • 0030371597 scopus 로고    scopus 로고
    • Generating and counting Hamilton cycles in random regular graphs
    • A. Frieze, M. Jerrum, M. Molloy, R. Robinson, and N. Wormald, Generating and counting Hamilton cycles in random regular graphs, J Algor 21 (1996), 175-198.
    • (1996) J Algor , vol.21 , pp. 175-198
    • Frieze, A.1    Jerrum, M.2    Molloy, M.3    Robinson, R.4    Wormald, N.5
  • 7
    • 84974325255 scopus 로고
    • Random regular graphs: Asymptotic distribution and contiguity
    • S. Janson, Random regular graphs: asymptotic distribution and contiguity, Comb Probab Comp 4 (1995), 369-405.
    • (1995) Comb Probab Comp , vol.4 , pp. 369-405
    • Janson, S.1
  • 8
    • 84990666040 scopus 로고
    • Almost all cubic graphs are Hamiltonian
    • R.W. Robinson and N. C. Wormald, Almost all cubic graphs are Hamiltonian, Random Struct Alg 3 (1992), 117-125.
    • (1992) Random Struct Alg , vol.3 , pp. 117-125
    • Robinson, R.W.1    Wormald, N.C.2
  • 9
    • 84990710889 scopus 로고
    • Almost all regular graphs are Hamiltonian
    • R.W. Robinson and N.C. Wormald, Almost all regular graphs are Hamiltonian. Random Struct Alg 5 (1994), 363-374.
    • (1994) Random Struct Alg , vol.5 , pp. 363-374
    • Robinson, R.W.1    Wormald, N.C.2
  • 10
    • 0001380311 scopus 로고
    • Limit theorems for stochastic processes
    • A.V. Skorokhod, Limit theorems for stochastic processes, Theor Probab Appl 1 (1956), 261-290.
    • (1956) Theor Probab Appl , vol.1 , pp. 261-290
    • Skorokhod, A.V.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.