Chromatic Number Bounds (Independence Number, Critical Graphs)

Key lower and upper bounds on the chromatic number $\chi(G)$: the independence-number lower bound $\chi \ge n/\alpha$, greedy degree-based upper bounds, and the minimum-degree property of color-critical graphs.