Colouring random graphs
- 1 October 1984
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 1 (3) , 183-200
- https://doi.org/10.1007/bf01874388
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Random hypergraph coloring algorithms and the weak chromatic numberJournal of Graph Theory, 1985
- A theoretical analysis of backtracking in the graph coloring problemJournal of Algorithms, 1985
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spacesJournal of Algorithms, 1984
- A review of random graphsJournal of Graph Theory, 1982
- On the probable behaviour of some algorithms for finding the stability number of a graphMathematical Proceedings of the Cambridge Philosophical Society, 1982
- Achromatic numbers of random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1982
- Probabilistic analysis of a heuristic graph coloring algorithmElectronics and Communications in Japan (Part I: Communications), 1982
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- An Algorithm for the Chromatic Number of a GraphJournal of the ACM, 1974