Deciding 3-colourability in less than O(1.415n) steps
In this paper we describe and analyze an improved algorithm for deciding the 3-Colourability problem. If G is a simple graph on n vertices then we will show that this algorithm tests a graph for 3-Colourability, i.e. an assignment of three colours to the vertices of G such that two adjacent vertices obtain different colours, in less than O(1.415n) steps.
Key wordsGraph algorithm k-colouring complexity
Unable to display preview. Download preview PDF.
- J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (Macmillan, London and Elsevier, New York, 1976).Google Scholar
- N. Christofides, An Algorithm for the Chromatic Number of a Graph, Computer J. 14(1971)38–39.Google Scholar
- M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of N P-Completeness, W. H. Freeman and Company, New York, 1979.Google Scholar
- M. R. Garey and D. S. Johnson, The complexity of Near-Optimal Graph Coloring, J. ACM 23 (1976) 43–49.Google Scholar
- D. S. Johnson, The NP-Completeness Column: An Ongoing Guide, J. of Alg. 13 (1992) 502–524.Google Scholar
- E. L. Lawler, A Note on the Complexity of the Chromatic Number Problem, Inform. Process. Lett. 5 (1976) 66–67.Google Scholar
- J. W. Moon and L. Moser, On Cliques in Graphs, Israel J. of Math. 3 (1965) 23–28.Google Scholar