Title of article
Chromatic numbers and products Original Research Article
Author/Authors
D. Duffus، نويسنده , , N.W. Sauer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
9
From page
91
To page
99
Abstract
Let image be the smallest number so that there are two n chromatic graphs whose product has chromatic number image. Under the assumption that a certain sharper result than one obtained by Duffus et al. [On the chromatic number of the product of graphs, J. Graph Theory 9 (1985) 487–495], and Welzl [Symmetric graphs and interpretations, J. Combin. Theory, Sci. B 37 (1984) 235–244], holds we will prove that image.
Keywords
Chromatic number , Hedetniemi conjecture , Graph product
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948430
Link To Document