A survey on Hedetniemi's conjecture
X Zhu - Taiwanese Journal of Mathematics, 1998 - projecteuclid.org
Taiwanese Journal of Mathematics, 1998•projecteuclid.org
More than 30 years ago, Hedetniemi made a conjecture which says that the categorical
product of two n-chromatic graphs is still n-chromatic. The conjecture is still open, despite
many dierent approaches from dierent point of views. This article surveys methods and
partial results; and discuss problems related to or motivated by this conjecture.
product of two n-chromatic graphs is still n-chromatic. The conjecture is still open, despite
many dierent approaches from dierent point of views. This article surveys methods and
partial results; and discuss problems related to or motivated by this conjecture.
More than 30 years ago, Hedetniemi made a conjecture which says that the categorical product of two n-chromatic graphs is still n-chromatic. The conjecture is still open, despite many dierent approaches from dierent point of views. This article surveys methods and partial results; and discuss problems related to or motivated by this conjecture.
Project Euclid以上显示的是最相近的搜索结果。 查看全部搜索结果