[1] APPEL K., HAKEN W.: Every planar map is four colorable. Bull Amer. Math. Soc., 82, 1976, 711-712. MR 0424602 | Zbl 0331.05106

[2] BONDY J. A.: Bounds for the chromatic number of a graph. J. Comb. Theory, 7, 1969,96-98. MR 0241320 | Zbl 0182.57802

[3] CHARTRAND G., POLIMENI A. D.: Ramsey theory and chromatic numbers. Pacific J. Math., 55, 1974, 39-43. MR 0371707 | Zbl 0284.05107

[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. MR 0140445

[5] GAREY M. R., JOHNSON D. S.: The complexity of near-optimal graph coloring. J. ACM 23, 1976, 43-49. MR 0426496 | Zbl 0322.05111

[6] HARARY F.: Graph theory. Addison-Wesley, Reading, Mass., 1969. MR 0256911 | Zbl 0196.27202

[7] HARARY F., HSU D., MILLER Z.: The biparticity of a graph. J. Graph Theory, 1, 1977, 131-133. MR 0444523 | Zbl 0376.05043

[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. MR 0284373

[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. MR 0389644 | Zbl 0308.05109

[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. MR 0378476

[11] KING T., NEMHAUSER G. L.: Some inequalities on the chromatic number of a graph. Discrete Math., 10, 1974, 117-121. MR 0349459 | Zbl 0311.05111

[12] LAWLER E. L.: A note on the complexity of the chromatic number problem. Infor. Processing Letters 5, 1976, 66-67. MR 0464675 | Zbl 0336.68021

[13] MATULA D. W.: k-components, clusters, and slicings in graphs. SIAM J. appl. Math., 22, 1972, 459-480. MR 0306051

[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. MR 0351880 | Zbl 0256.05108

[15] MITCHEM J.: On various algorithms for estimating the chromatic number of a graph. Computer J., 10, 1976, 182-183. MR 0437376 | Zbl 0334.05104

[16] MYERS B. R., LIU R. W.: A lower bound on the chromatic number of a graph. Networks, 1, 1972, 273-277. MR 0297628 | Zbl 0233.05105

[17] ORE O.: The four color problem. Academic Press, New York 1967, MR 0216979 | Zbl 0149.21101

[18] PLESNÍK J.: Bounds on chromatic numbers of multiple factors of a complete graph. J, Graph Theory, 2, 1978, 9-17. MR 0486179 | Zbl 0375.05027

[19] SCHURGER K.: Inequalities for the chromatic numbers of graphs. J. Comb. Theory (B), 16, 1974, 77-85. MR 0332548

[20] VIZING V. G.: On an estimate of the chromatic class of a p-graph. (Russian). Diskret. Analiz, 3, 1964, 25-30. MR 0180505

[21] WILF H. S.: The eingevalues of a graph and its chromatic number. J. London Math. Soc., 42, 1967, 330-332. MR 0207593

[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. MR 0051516