Chromatic number & Brooks' theorem

Layer 0 — Mathematicsin the graph-theory subtree

χ(G) ≤ Δ(G) for connected graph except K_n and odd cycle (Brooks 1941). Mycielski: triangle-free graphs of arbitrarily high χ.

Related concepts

Explore Chromatic number & Brooks' theorem on the interactive knowledge graph →