On chromatic number of product of graphs

Previous | Up | Next

Article

On chromatic number of product of graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 1, pp. 1-12

MSC: 03E05, 03E35, 05C15 | MR 937544 | Zbl 0643.03036

References:

[1] J. E. BAUMGARTNER: Generic graph construction. J. Symbolic Logic 49 (1984), 234-240 MR 0736618 | Zbl 0573.03021

[2] M. EL-ZAHAR N. SAUER: The chromatic number of product of two 4-chromatic graphs is 4. Combinatorica 5 (1985), 121-126. MR 0815577

[3] A. HAJNAL: The chromatic number of the product of two, -chromatic graphs can be countable. Combinatorica 5 (1985), 137-139. MR 0815579

[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 0506523 | Zbl 0419.03028

Partner of