Degree sequences of random graphs
- 1 January 1981
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 33 (1), 1-19
- https://doi.org/10.1016/0012-365x(81)90253-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On graphs with equal edge connectivity and minimum degreeDiscrete Mathematics, 1979
- Chromatic number, girth and maximal degreeDiscrete Mathematics, 1978
- Uniquely Partitionable GraphsJournal of the London Mathematical Society, 1977
- Uniquely Colourable Graphs with Large GirthCanadian Journal of Mathematics, 1976
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Turán's theorem for k-graphsDiscrete Mathematics, 1972
- On the probability in the tail of a binomial distributionAdvances in Applied Probability, 1969
- Graph Theory and Probability. IICanadian Journal of Mathematics, 1961