Graph Coloring Calculator
Color vertices of a graph such that no two adjacent vertices share the same color.
Graph Input
Vertex Colors
v0: Red
v1: Blue
v2: Green
v3: Red
v4: Blue
Chromatic Number (Greedy Upper Bound)
chi(G) = 3
Vertices
5
Edges
6
Max Degree
3
Upper Bound (Delta+1)
4
Graph Properties
BipartiteNo
About Graph Coloring
- Graph coloring assigns colors to vertices so no adjacent vertices share a color
- The chromatic number chi(G) is the minimum colors needed
- Greedy algorithm provides an upper bound: chi(G) ≤ Delta(G) + 1
- For bipartite graphs, chi(G) = 2