Chromatic Number
Chromatic Number of a graph is the smallest number of colors needed to color the vertices so that no two adjacent vertices share the same color.
Application of Chromatic Number
- Scheduling tasks
- Register allocations
- Server updating
- Pattern matching
- Solving suduko (9 coloring)
- Bipartite graph
- Map coloring etc.