Defective Coloring Revisited

Journal of Graph Theory

Volumn 24, Issue 3, 1997, Pages 205-219

  Cowen, Lenore ^a   Goddard, Wayne ^b   Jesurum, C Esther ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UNIVERSITY OF KWAZULU NATAL   (South Africa)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346248845     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T     Document Type: Article

References (32)

1. J. Andrews and M. Jacobson, On a generalization of chromatic number, Congressus Numer. 47 (1985), 33-48.
2. D. Archdeacon, A note on defective coloring of graphs in surfaces, J. Graph Theory 11 (1987), 517-519.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 14-23, 1992.
4. C. Bernardi, On a theorem about vertex colorings of graphs, Discrete Math. 64 (1987), 95-96.
5. A. Blum, New approximation algorithms for graph coloring, J. ACM 41 (1994), 470-516.
6. A. Blum and D. Karger, unpublished manuscript (1996).
7. B. Berger and J. Rompel, A better performance guarantee for approximate graph coloring, Algorithmica 5(4) (1990), 459-466.
8. O. Borodin and A. Kostochka, On an upper bound of a graph's chromatic number depending on the graph's degree and density, J. Combinatorial Theory, Ser. B 23 (1977), 247-250.
9. N. Chiba, T. Nishizeki, and N. Saito, A linear-time algorithm for 5-coloring a planar graph, J. Algorithms 2 (1981), 317-327.
10. L. Cowen, R. Cowen, and D. Woodall, Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valence, J. Graph Theory 10 (1986), 187-195.
11. R. Cowen, Some connections between set theory and computer science, in G. Gottlob, A. Leitsch, and D. Mundici (eds.), Proceedings of the third Kurt Godel colloquium on Computational Logic and proof theory, Lecture Notes in Computer Science, pages 14-22. Springer-Verlag (1993).
12. G. Fredrickson, On linear-time algorithms for five-coloring planar graphs, Information Processing Lett. 19 (1984), 219-224.
13. M. Frick, A survey of (m, k)-colorings, in J. Gimbel, J. W. Kennedy, and L. V. Quintas (eds.), Quo Vadis, Graph Theory?, volume 55 of Annals of Discrete Mathematics, pages 45-58. Elsevier Science Publishers, New York (1993).
14. M. Frick and M. Henning, Extremal results on defective colorings of graphs, Discrete Math. 126 (1994), 151-158.
15. W. Goddard, Acyclic colorings of planar graphs, Discrete Math 91 (1991), 91-94.
16. M. Goemans and D. Williamson, .878-approximation algorithms for MAX CUT and MAX 2SAT, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing (1994).
17. M. Halldorsson, A still better performance guarantee for approximate graph coloring, Information Processing Lett. 45 (1993), 19-23.
18. F. Harary and K. Jones, Conditional colorability II: Bipartite variations, Congressus Numer. 50 (1985), 205-218.
19. T. Jensen and B. Toft, Graph Coloring Problems, John Wiley and Sons, New York (1995).
20. D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994).
21. J. Lawrence, Covering the vertex set of a graph with subgraphs of smaller degree, Discrete Math. 21 (1978), 271-273.
22. L. Lovász, On decomposition of graphs, Studia Sci. Math. Hangar. 1 (1966), 237-238.
23. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 286-293 (1993).
24. D. Matula, Y. Shiloah, and R. Tarjan, Two linear-time algorithms for five-coloring a planar graph, technical report STAN-CS-80-830, Dept. of CS, Stanford U.
25. B. Mohar, Embedding graphs in an arbitrary surface in linear time, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996).
26. K. Poh, On the linear vertex-arboricity of a planar graphs, J. Graph Theory 14 (1990), 73-75.
27. G. Ringel, Map Color Theorem, Springer-Verlag, Berlin (1974).
28. N. Robertson, D. Saunders, P. Seymour, and R. Thomas, Efficiently four-coloring planar graphs, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996).
29. L. Stockmeyer, Planar 3-colorability is NP-complete, SIGACT news 5 (1973), 19-25.
30. A. Wigderson, Improving the performance for approximate graph coloring, J. ACM 30 (1983), 729-735.
31. M. Williams, A linear algorithm for coloring planar graphs with five colors, Comput. J., 28 (1985), 78-81.
32. D. Woodall, Improper colourings of graphs, in R. Nelson and R. J. Wilson (eds.), Graph Colourings, Longman Scientific and Technical (1990).