Home / Graph Theory / Chromatic Number and applications

Chromatic Number and applications

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

  1. Scheduling tasks
  2. Register allocations
  3. Server updating
  4. Pattern matching
  5. Solving suduko (9 coloring)
  6. Bipartite graph
  7. Map coloring etc.