 A graph "K" is called multiplicative if for any graphs "G", "H", the fact that "G" × "H" → "K" holds implies that "G" → "K" or "H" → "K" holds.As with classical colorings, the reverse implication always holds