Chromatic Number Calculator

χ(G) = min colors

All Tools

Loading tool...

About Chromatic Number Calculator

A chromatic number calculator finding χ(G): the minimum k such that adjacent vertices get different colors. χ(K_n)=n, χ(C_{2n+1})=3, χ(K_{m,n})=2. Four Color Theorem: χ(planar)≤4. NP-hard in general. Client-side for small graphs.

Chromatic Number Calculator Features

  • χ(G) value
  • Coloring display
  • Common graphs
  • Four Color Theorem
  • Greedy bound
Advertisement
Advertisement