| Vertex Coloring
-
A k-coloring of a graph
is a mapping of the vertices of
onto a set with elements such that adjacent vertices are mapped onto different elements.
These elements are called colors; often, these elements
are denoted by integers
.
-
A graph is called k-colorable if it has a k-coloring.
-
The chromatic number
of a graph
is the minimal for which the graph is k-colorable.
-
A graph with chromatic number
is called k-chromatic.
|
|