Determining the Chromatic Number of a Graph
- 1 February 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (1), 1-14
- https://doi.org/10.1137/0208001
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- 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
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971
- A technique for colouring a graph applicable to large scale timetabling problemsThe Computer Journal, 1969
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967