GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
- 1 January 1972
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- k-Components, Clusters and Slicings in GraphsSIAM Journal on Applied Mathematics, 1972
- Bounds for the chromatic number of a graphJournal of Combinatorial Theory, 1969
- Majorants of the Chromatic Number of a Random GraphJournal of the Royal Statistical Society Series B: Statistical Methodology, 1969
- A technique for colouring a graph applicable to large scale timetabling problemsThe Computer Journal, 1969
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967
- The preparation of examination time-tables using a small-store computerThe Computer Journal, 1964
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941