论文信息 - Chromatic Numbers

Chromatic Numbers

The Chromatic Number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color.

Padal Nihar

[1] J. R. Brown. Chromatic Scheduling and the Chromatic Number Problem , 1972 .

[2] Gregory J. Chaitin,et al. Register allocation and spilling via graph coloring , 2004, SIGP.

[3] Gerold Jäger,et al. Mathematical programming and game theory for decision making , 2008 .