An Algorithm for Determining the Chromatic Number of a Graph
- 1 December 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (4) , 311-318
- https://doi.org/10.1137/0202026
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971
- Point-symmetric graphs with a prime number of pointsJournal of Combinatorial Theory, 1967
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- A contribution to the development of ALGOLCommunications of the ACM, 1966
- On cliques in graphsIsrael Journal of Mathematics, 1965