 For any fixed graph "K", one considers graphs "G" that admit a homomorphism to "K", written "G" → "K".These are also called "K"-colorable graphs.This generalizes the usual notion of graph coloring, since it follows from definitions that a "k"-coloring is the same as a "Kk"-coloring (a homomorphism into the complete graph on "k" vertices).