The chromatic number of random graphs at the double-jump threshold
- 1 March 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (1) , 39-49
- https://doi.org/10.1007/bf02122682
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Graphs having circuits with at least two chordsJournal of Combinatorial Theory, Series B, 1982
- The longest path in a random graphCombinatorica, 1981
- The number of connected sparsely edged graphs. III. Asymptotic resultsJournal of Graph Theory, 1980
- Probability of Indecomposability of a Random Mapping FunctionThe Annals of Mathematical Statistics, 1955