Learning

Vertex Coloring and Its Applications

Graph Fundamentals → Sudoku as a Coloring Problem

This advanced university-level path systematically covers graph vertex coloring: from foundational graph theory and the chromatic number, through greedy and exact coloring algorithms, to structural theorems such as the four-color theorem and modern applications in scheduling, register allocation, and Sudoku. It emphasizes rigorous proofs and algorithmic thinking, with connections to related graph parameters.