Graph Theory · Algebra & Patterning
Graph Coloring
The chromatic number is the minimum colors needed so no adjacent vertices share a color — modeling scheduling, register allocation, and frequency assignment.
WHAT STUDENTS WILL LEARN
✓Define chromatic number χ(G)
✓Apply greedy coloring
✓State Brooks’ theorem
✓Apply chromatic polynomials
COURSE OUTLINE · CLICK A PART FOR RESOURCES