Coloring of graphs by partitioning

 Access to full text

 Full (PDF)

1. APPEL K., HAKEN W., Every planar map is four colorable, Bull Amer. Math. Soc., 82, 1976, 711-712. (1976) Zbl0331.05106MR0424602
2. BONDY J. A., Bounds for the chromatic number of a graph, J. Comb. Theory, 7, 1969,96-98. (1969) Zbl0182.57802MR0241320
3. CHARTRAND G., POLIMENI A. D., Ramsey theory and chromatic numbers, Pacific J. Math., 55, 1974, 39-43. (1974) Zbl0284.05107MR0371707
4. ERSHOV A. P., KOZHUKHIN G. I., Estimates of the chromatic number of a connected graph, (Russian) Dokl. akad. nauk SSSR 142, 1962, 270-273. Soviet. Math. Dokl., 3, 1962, 50-53. (1962) MR0140445
5. GAREY M. R., JOHNSON D. S., The complexity of near-optimal graph coloring, J. ACM 23, 1976, 43-49. (1976) Zbl0322.05111MR0426496
6. HARARY F., Graph theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
7. HARARY F., HSU D., MILLER Z., The biparticity of a graph, J. Graph Theory, 1, 1977, 131-133. (1977) Zbl0376.05043MR0444523
8. HOFFMAN, A J., On eigenvalues and coloring of graphs, In: Graph theory and its applications, (B. Harris, ed.), Academic Press, New York 1970, 79-91. (1970) MR0284373
9. JOHNSON D. S., Worst case behavior of graph coloring algorithms, In: Proc. of the Fifth south-eastern Conf. on Combinatorics, Graph theory, and Computing, Utilitas Mathematica Publishing, Winnipeg, Canada 1974, 513-528. (1974) Zbl0308.05109MR0389644
10. KARP R. M., Reducibility among combinatorial problems, In: Complexity of computer computation (R. E. Miller and J, W. Thatcher, eds.) Plenum Press, New York 1972, 85-103. (1972) MR0378476
11. KING T., NEMHAUSER G. L., Some inequalities on the chromatic number of a graph, Discrete Math., 10, 1974, 117-121. (1974) Zbl0311.05111MR0349459
12. LAWLER E. L., A note on the complexity of the chromatic number problem, Infor. Processing Letters 5, 1976, 66-67. (1976) Zbl0336.68021MR0464675
13. MATULA D. W., k-components, clusters, and slicings in graphs, SIAM J. appl. Math., 22, 1972, 459-480. (1972) MR0306051
14. MATULA D. M., MARBLE G., ISAACSON J. D., Graph coloring algorithms, In: Graph theory and Computing (R. C. Read, ed.), Academic Press, New York 1972, 109-122. (1972) Zbl0256.05108MR0351880
15. MITCHEM J., On various algorithms for estimating the chromatic number of a graph, Computer J., 10, 1976, 182-183. (1976) Zbl0334.05104MR0437376
16. MYERS B. R., LIU R. W., A lower bound on the chromatic number of a graph, Networks, 1, 1972, 273-277. (1972) Zbl0233.05105MR0297628
17. ORE O., The four color problem, Academic Press, New York 1967, (1967) Zbl0149.21101MR0216979
18. PLESNÍK J., Bounds on chromatic numbers of multiple factors of a complete graph, J, Graph Theory, 2, 1978, 9-17. (1978) Zbl0375.05027MR0486179
19. SCHURGER K., Inequalities for the chromatic numbers of graphs, J. Comb. Theory (B), 16, 1974, 77-85. (1974) MR0332548
20. VIZING V. G., On an estimate of the chromatic class of a p-graph, (Russian). Diskret. Analiz, 3, 1964, 25-30. (1964) MR0180505
21. WILF H. S., The eingevalues of a graph and its chromatic number, J. London Math. Soc., 42, 1967, 330-332. (1967) MR0207593
22. ZYKOV, A A., On some properties of linear complexes, (Russian). Math. Sborník, 24 (66), 1949, 161-188. Amer. Math. Soc. Transl., No. 79, 1952. (1949) MR0051516