Vertex Coloring

[babyachievement]

Vertex同Node

问题描述：

(Vertex Coloring). Given an undirected graph G = (V, E), assign
a color c(v) to each vertex v ∈ V such that the following holds: e = (v, w) ∈
E ⇒ c(v) != c(w).

Chromatic Number：色数

Given an undirected Graph G = (V, E),
the chromatic number χ(G) is the minimum number of colors to solve Problem

度

 (Degree). The number of neighbors of a vertex v, denoted by
δ(v), is called the degree of v. The maximum degree vertex in a graph G defines
the graph degree ∆(G) = ∆.

色数是解节点着色问题需要的最小颜色数量。