On the chromatic forcing number of a random graph
- 31 January 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (1) , 123-132
- https://doi.org/10.1016/0166-218x(83)90022-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Achromatic numbers of random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1982
- Vertices of given degree in a random graphJournal of Graph Theory, 1982
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- The tail of the hypergeometric distributionDiscrete Mathematics, 1979
- On the chromatic index of almost all graphsJournal of Combinatorial Theory, Series B, 1977
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- An Algorithm for Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1973