Abstract
We present a polynomial time approximation algorithm to colour a 3-colourable graph G with 3f(n) colours, if G has minimum degree δ(G)≥αn/f(n), where Ω(1)≤f(n)<O(n) and α is a positive constant. We also discuss NP—completeness and #P—completeness of restricted k-Colourability problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Blum, New Approximation Algorithms for Graph Colouring, J. ACM 41 (1994) 470–516.
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (Macmillan, London and Elsevier, New York, 1976).
N. Christofides, An Algorithm for the Chromatic Number of a Graph, Computer J. 14 (1971) 38–39.
K. Edwards, The Complexity of Colouring Problems on Dense Graphs, Theoretical Computer Sciene 43 (1986) 337–343.
S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691–703.
M. R. Garey and D. S. Johnson, The complexity of Near-Optimal Graph Coloring, J. ACM 23 (1976) 43–49.
M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of N P-Completeness, W. H. Freeman and Company, San Francisco, 1979.
S. Khanna, N. Linial and S. Safra, On the hardness of approximating the chromatic number, Proc. of the 2nd Israel Symp. on the Theory of Computing and Systems, IEEE Computer Society, 250–260.
E. L. Lawler, A Note on the Complexity of the Chromatic Number Problem, Inform. Process. Lett. 5 (1976) 66–67.
L. Lovász, On the Ratio of Optimal and Fractional Covers, Discrete Math. 13 (1975) 383–390.
C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc. of the Annual ACM Symposium on the Theory of Computing, Vol.25 (1993) 286–293.
B. Monien and E. Speckenmeyer, Solving Satisfiability in less than 2n Steps, Discrete Appl. Math. 10 (1985) 287–295.
J. W. Moon and L. Moser, On Cliques in Graphs, Israel J. of Math. 3 (1965) 23–28.
J. M. Robson, Algorithms for Maximum Independent Sets, J. of Alg. 7 (1986) 425–440.
I. Schiermeyer, Solving 3-Satisfiability in less than 1,579n Steps, Lecture Notes in Computer Science 702 (1993) 379–394.
I. Schiermeyer, Fast exact Colouring Algorithms, RWTH Aachen, preprint 1993, Journal Tatra Mountains Mathematical Publications, in print.
R. E. Tarjan and A. E. Trojanowski, Finding a Maximum Independent Set, SIAM J. Comput., Vol. 6, No. 3, September 1977, 537–546.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schiermeyer, I. (1995). An approximation algorithm for 3-Colourability. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_72
Download citation
DOI: https://doi.org/10.1007/3-540-60618-1_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60618-5
Online ISBN: 978-3-540-48487-5
eBook Packages: Springer Book Archive