@article{MASLO_1980_30_2_a2,
author = {Plesn{\'\i}k, J\'an},
title = {Coloring of graphs by partitioning},
journal = {Mathematica slovaca},
pages = {121--126},
year = {1980},
volume = {30},
number = {2},
mrnumber = {587236},
zbl = {0438.05029},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1980_30_2_a2/}
}
Plesník, Ján. Coloring of graphs by partitioning. Mathematica slovaca, Tome 30 (1980) no. 2, pp. 121-126. http://geodesic.mathdoc.fr/item/MASLO_1980_30_2_a2/
[1] APPEL K., HAKEN W.: Every planar map is four colorable. Bull Amer. Math. Soc., 82, 1976, 711-712. | MR | Zbl
[2] BONDY J. A.: Bounds for the chromatic number of a graph. J. Comb. Theory, 7, 1969,96-98. | MR | Zbl
[3] CHARTRAND G., POLIMENI A. D.: Ramsey theory and chromatic numbers. Pacific J. Math., 55, 1974, 39-43. | MR | Zbl
[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
[5] GAREY M. R., JOHNSON D. S.: The complexity of near-optimal graph coloring. J. ACM 23, 1976, 43-49. | MR | Zbl
[6] HARARY F.: Graph theory. Addison-Wesley, Reading, Mass., 1969. | MR | Zbl
[7] HARARY F., HSU D., MILLER Z.: The biparticity of a graph. J. Graph Theory, 1, 1977, 131-133. | MR | Zbl
[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
[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 | Zbl
[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
[11] KING T., NEMHAUSER G. L.: Some inequalities on the chromatic number of a graph. Discrete Math., 10, 1974, 117-121. | MR | Zbl
[12] LAWLER E. L.: A note on the complexity of the chromatic number problem. Infor. Processing Letters 5, 1976, 66-67. | MR | Zbl
[13] MATULA D. W.: k-components, clusters, and slicings in graphs. SIAM J. appl. Math., 22, 1972, 459-480. | MR
[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 | Zbl
[15] MITCHEM J.: On various algorithms for estimating the chromatic number of a graph. Computer J., 10, 1976, 182-183. | MR | Zbl
[16] MYERS B. R., LIU R. W.: A lower bound on the chromatic number of a graph. Networks, 1, 1972, 273-277. | MR | Zbl
[17] ORE O.: The four color problem. Academic Press, New York 1967, | MR | Zbl
[18] PLESNÍK J.: Bounds on chromatic numbers of multiple factors of a complete graph. J, Graph Theory, 2, 1978, 9-17. | MR | Zbl
[19] SCHURGER K.: Inequalities for the chromatic numbers of graphs. J. Comb. Theory (B), 16, 1974, 77-85. | MR
[20] VIZING V. G.: On an estimate of the chromatic class of a p-graph. (Russian). Diskret. Analiz, 3, 1964, 25-30. | MR
[21] WILF H. S.: The eingevalues of a graph and its chromatic number. J. London Math. Soc., 42, 1967, 330-332. | MR
[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