Size and connectivity of the k-core of a random graph
Author:
- 1 August 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 91 (1) , 61-68
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The chromatic number of random graphs at the double-jump thresholdCombinatorica, 1989
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963