Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539)

A well-known theorem of \textit{G. Sabidussi} [Monatsh. Math. 68, 426--438 (1964; Zbl 0136.44608)] states that the chromatic number of the Cartesian product of two graphs equals the maximum of the chromatic number of the factors. The authors show that an analog of the theorem of Sabidussi is true for vector chromatic number, strict vector chromatic number, and quantum chromatic number. A well-known conjecture of Hedetniemi claims that the chromatic number of the categorical product of two graphs equals the minimum of the chromatic number of the factors. It is shown in the paper that an analog of the conjecture is true for the strict vector chromatic number.