Satz 1.65 — Proof visualization

If every induced subgraph of G has a vertex of degree ≤ k, then χ(G) ≤ k + 1. Example: k = 2.

Phase 1: removal ordering
Phase 2: greedy coloring
Current degrees in remaining graph
Coloring order: v₁, v₂, …, v₆