Open Access
1998 A SURVEY ON HEDETNIEMI'S CONJECTURE
Xuding Zhu
Taiwanese J. Math. 2(1): 1-24 (1998). DOI: 10.11650/twjm/1500406890

Abstract

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.

Citation

Download Citation

Xuding Zhu. "A SURVEY ON HEDETNIEMI'S CONJECTURE." Taiwanese J. Math. 2 (1) 1 - 24, 1998. https://doi.org/10.11650/twjm/1500406890

Information

Published: 1998
First available in Project Euclid: 18 July 2017

zbMATH: 0906.05024
MathSciNet: MR1609464
Digital Object Identifier: 10.11650/twjm/1500406890

Subjects:
Primary: 05C

Keywords: Chromatic number , graph product , Hedetniemi conjecture

Rights: Copyright © 1998 The Mathematical Society of the Republic of China

Vol.2 • No. 1 • 1998
Back to Top