Previous |  Up |  Next

Article

Title: On chromatic number of product of graphs (English)
Author: Soukup, Lajos
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 29
Issue: 1
Year: 1988
Pages: 1-12
.
Category: math
.
MSC: 03E05
MSC: 03E35
MSC: 05C15
idZBL: Zbl 0643.03036
idMR: MR937544
.
Date available: 2008-06-05T21:31:22Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/106592
.
Reference: [1] J. E. BAUMGARTNER: Generic graph construction.J. Symbolic Logic 49 (1984), 234-240 Zbl 0573.03021, MR 0736618
Reference: [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
Reference: [3] A. HAJNAL: The chromatic number of the product of two, -chromatic graphs can be countable.Combinatorica 5 (1985), 137-139. MR 0815579
Reference: [4] S. T. HEDETNIEMI: Homomorphisms of graphs and automata.Univ. of Michigan Technical Report 03 105-44-T, 1966
Reference: [5] T. JECH: Set Theory.Academic Press, New York, 1978. Zbl 0419.03028, MR 0506523
.

Files

Files Size Format View
CommentatMathUnivCarol_029-1988-1_1.pdf 847.4Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo