On chromatic number of product of graphs
Commentationes Mathematicae Universitatis Carolinae, Tome 29 (1988) no. 1, pp. 1-12
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Soukup, Lajos. On chromatic number of product of graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 29 (1988) no. 1, pp. 1-12. http://geodesic.mathdoc.fr/item/CMUC_1988_29_1_a0/
@article{CMUC_1988_29_1_a0,
author = {Soukup, Lajos},
title = {On chromatic number of product of graphs},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {1--12},
year = {1988},
volume = {29},
number = {1},
mrnumber = {937544},
zbl = {0643.03036},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1988_29_1_a0/}
}
[1] J. E. BAUMGARTNER: Generic graph construction. J. Symbolic Logic 49 (1984), 234-240 | MR | Zbl
[2] M. EL-ZAHAR N. SAUER: The chromatic number of product of two 4-chromatic graphs is 4. Combinatorica 5 (1985), 121-126. | MR
[3] A. HAJNAL: The chromatic number of the product of two, -chromatic graphs can be countable. Combinatorica 5 (1985), 137-139. | MR
[4] S. T. HEDETNIEMI: Homomorphisms of graphs and automata. Univ. of Michigan Technical Report 03 105-44-T, 1966
[5] T. JECH: Set Theory. Academic Press, New York, 1978. | MR | Zbl