1 paper · 1 filter
Tamás Csernák
A coloring of a direct product of graphs is said to be {\em trivial} iff it is induced by some coloring of a factor of the product. A graph G is trivially power colorable iff eve…