Linked from

The 30 pages that link to Graph coloring, each with the reason it gives.

• Four color theoremNarrower topic: The theorem is a universal upper bound on the number of colors needed.

• Chromatic numberNarrower topic: Chromatic number is the minimum color count in the vertex-coloring version of this broader problem.

• Brooks' theoremNarrower topic: Brooks' theorem bounds the minimum number of colors needed for a proper vertex coloring.

• Erdős–Faber–Lovász conjectureNarrower topic: The conjecture asks whether the union can always be colored using at most n colors.

• Five color theoremNarrower topic: The theorem is a universal upper bound for vertex coloring on planar graphs.

• Heawood conjectureNarrower topic: The conjecture bounds the colors required for graphs constrained by a surface.

• De Bruijn–Erdős theorem (graph theory)Narrower topic: The theorem concerns when a coloring with a fixed finite palette exists.

• Grötzsch's theoremNarrower topic: The theorem guarantees a three-coloring for a restricted class of graphs.

• Hedetniemi's conjectureNarrower topic: The conjecture compares the minimum numbers of colors needed before and after taking a product.