SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 34, Issue 1, 2000, Pages 42-59

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k

(4) Bollobas B a Cooper, C b Fenner, T I c Frieze, A M d

a University of Memphis (United States)

b LONDON METROPOLITAN UNIVERSITY (United Kingdom)

c UNIVERSITY OF LONDON (United Kingdom)

d CARNEGIE MELLON UNIVERSITY (United States)

Author keywords

Hamilton cycles; Random graphs

Indexed keywords

EID: 0034180099 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H Document Type: Article

Times cited : (22)

References (13)

1
- 0004219960
- Academic, New York
- B. Bollobás, Random graphs, Academic, New York, 1985.
- (1985) Random Graphs
- Bollobás, B.¹

2
- 0037845495
- A tribute to Paul Erdos, A. Baker, B. Bollobas, and A. Hajnal (Editors)
- B. Bollobás, T. I. Fenner, and A. M. Frieze, "Hamilton cycles in random graphs of minimal degree at least k," A tribute to Paul Erdos, A. Baker, B. Bollobas, and A. Hajnal (Editors), 1990, pp. 59-96.
- (1990) Hamilton Cycles in Random Graphs of Minimal Degree at Least K , pp. 59-96
- Bollobás, B.¹ Fenner, T.I.² Frieze, A.M.³

3
- 0027149104
- On the satisfiability and maximum satisfiability of random 3-CNF formulas
- ACM New York and SIAM Philadelphia
- A. Z. Broder, A. M. Frieze, and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, Proc Fourth Ann ACM-SIAM Symp Discr Algorith, ACM New York and SIAM Philadelphia 1993 pp. 322-330.
- (1993) Proc Fourth Ann ACM-SIAM Symp Discr Algorith , pp. 322-330
- Broder, A.Z.¹ Frieze, A.M.² Upfal, E.³

4
- 0004083492
- Wadsworth & Brooks Cole
- R. Durrett, Probability: theory and examples, Wadsworth & Brooks Cole, 1991.
- (1991) Probability: Theory and Examples
- Durrett, R.¹

5
- 0242337571
- On the existence of Hamilton cycles in a class of random graphs
- T. I. Fenner and A. M. Frieze, On the existence of Hamilton cycles in a class of random graphs, Discr Math 45 (1983), 301-305.
- (1983) Discr Math , vol.45 , pp. 301-305
- Fenner, T.I.¹ Frieze, A.M.²

6
- 0004134071
- Chelsea, New York
- B. V. Gnedenko, Theory of probability, Chelsea, New York, 1963.
- (1963) Theory of Probability
- Gnedenko, B.V.¹

7
- 0003496256
- Dover, New York
- A. I. Kinchin, Mathematical foundations of statistical mechanics, Dover, New York, 1949.
- (1949) Mathematical Foundations of Statistical Mechanics
- Kinchin, A.I.¹

8
- 0041604528
- Random mappings
- New York
- V. F. Kolchin, Random mappings, Optimization Software, New York, 1986.
- (1986) Optimization Software
- Kolchin, V.F.¹

9
- 85037491990
- Private communication
- B. Pittel, Private communication, 1993.
- (1993)
- Pittel, B.¹

10
- 0001208378
- On the likely shape of the random Ferrers diagram
- B. Pittel, On the likely shape of the random Ferrers diagram, Adv Appl Math 18 (1997), 432-488.
- (1997) Adv Appl Math , vol.18 , pp. 432-488
- Pittel, B.¹

11
- 0025476299
- A graph-valued polymerization model: Subcritical behaviour
- B. Pittel and W. A. Woyczynski, A graph-valued polymerization model: subcritical behaviour, SIAM J Appl Math 50 (1990), 1200-1220.
- (1990) SIAM J Appl Math , vol.50 , pp. 1200-1220
- Pittel, B.¹ Woyczynski, W.A.²

12
- 0000229634
- Hamilton circuits in random graphs
- L. Pósa, Hamilton circuits in random graphs, Discr Math 14 (1976), 359-364.
- (1976) Discr Math , vol.14 , pp. 359-364
- Pósa, L.¹

13
- 84990710889
- Almost all regular graphs are Hamiltonian
- 5.2
- R. W. Robinson and N. C. Wormald, Almost all regular graphs are Hamiltonian, Random Struc Algorith 5.2 (1994), 363-374.
- (1994) Random Struc Algorith , pp. 363-374
- Robinson, R.W.¹ Wormald, N.C.²

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