@article{106592, author = {Lajos Soukup}, title = {On chromatic number of product of graphs}, journal = {Commentationes Mathematicae Universitatis Carolinae}, volume = {029}, year = {1988}, pages = {1-12}, zbl = {0643.03036}, mrnumber = {937544}, language = {en}, url = {http://dml.mathdoc.fr/item/106592} }
Soukup, Lajos. On chromatic number of product of graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 029 (1988) pp. 1-12. http://gdmltest.u-ga.fr/item/106592/
Generic graph construction, J. Symbolic Logic 49 (1984), 234-240 (1984) | MR 0736618 | Zbl 0573.03021
The chromatic number of product of two 4-chromatic graphs is 4, Combinatorica 5 (1985), 121-126. (1985) | MR 0815577
The chromatic number of the product of two, -chromatic graphs can be countable, Combinatorica 5 (1985), 137-139. (1985) | MR 0815579
Homomorphisms of graphs and automata, Univ. of Michigan Technical Report 03 105-44-T, 1966
Set Theory, Academic Press, New York, 1978. (1978) | MR 0506523 | Zbl 0419.03028