Linked from

The 14 pages that link to Chromatic number, each with the reason it gives.

• Graph coloringRelated: It measures the optimal color count for the graph being colored.

• Four color theoremRelated: The theorem states that every planar graph has chromatic number at most four.

• Brooks' theoremRelated: The theorem compares this minimum directly with maximum degree.

• Chromatic polynomialRelated: It is the least positive integer at which the chromatic polynomial is nonzero.

• Graph homomorphismRelated: It is the smallest size of a complete graph receiving a homomorphism from the graph.

• Richard RadoRelated: Infinite graph coloring connects Rado’s graph theory to set-theoretic methods.

• Erdős–Faber–Lovász conjectureRelated: This is the quantity bounded by n in the conjecture.

• Five color theoremRelated: The theorem says every planar graph has chromatic number at most five.

• Borsuk's conjectureRelated: Graph coloring supplies a combinatorial language for some diameter-partition arguments.

• De Bruijn–Erdős theorem (graph theory)Related: The theorem equates finite-subgraph bounds with a bound for the entire graph.

• Grötzsch's theoremRelated: The theorem bounds this invariant by three for its specified graphs.

• Hedetniemi's conjectureRelated: It is the invariant predicted to equal the smaller factor's value.