An approach to hedetniemi's conjecture
β
N. W. Sauer; X. Zhu
π
Article
π
1992
π
John Wiley and Sons
π
English
β 717 KB
## Abstract For a fixed integer __n__ Ο΅ Ο, a graph __G__ of chromatic number greater than __n__ is called persistent if for all __n__ + 1βchromatic graphs __H__, the products __G__ Γ __H__ are __n__ + 1βchromatic graphs. Wheter all graphs of chromatic number greater than __n__ are persistent is a l