SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Mathematics

Volumn 91, Issue 1, 1991, Pages 61-68

Size and connectivity of the k-core of a random graph

(1) Łuczak, Tomasz a

a ADAM MICKIEWICZ UNIVERSITY (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011572855 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/0012-365X(91)90162-U Document Type: Article

Times cited : (114)

References (8)

1
- 0003562042
- Springer, Berlin
- (1979) Graphs Theory — An Introductory Course
- Bollobás¹

2
- 0004219960
- Academic Press, New York
- (1985) Random Graphs
- Bollobás¹

3
- 0011632190
- The evolution of sparse graphs
- Proc. Cambridge Combinatorial Conf. in honor of Paul Erdős, Academic Press, New York
- (1984) Graphs Theory and Combinatorics , pp. 35-57
- Bollobás¹

4
- 84876914045
- Long cycles in sparse random graphs
- Proc. Cambridge Combinatorial Conf. in honor of Paul Erdős, Academic Press, New York
- (1984) Graph Theory and Combinatorics , pp. 59-64
- Bollobás¹ Fenner² Frieze³

5
- 0001847481
- On the evolution of random graphs
- (1960) MTA Mat. Kut. Int. Közl , vol.5 , pp. 17-61
- Erdő¹ s² Rényi³

6
- 84947403595
- Probability Inequalities for Sums of Bounded Random Variables
- (1963) Journal of the American Statistical Association , vol.58 , pp. 13-30
- Hoeffding¹

7
- 84910775280
- On matchings and Hamiltonian cycles in subgraphs of random graphs
- North-Holland, Amsterdam
- (1987) Ann. Discrete Math. , vol.33 , pp. 171-185
- Łuczak¹

8
- 4244055741
- The chromatic number of random graphs at the double-jump threshold
- (1989) Combinatorica , vol.9 , pp. 39-49
- Łuczak¹ Wierman²

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