KnowraFour color theoremLinked fromLinked fromThe 15 pages that link to Four color theorem, each with the reason it gives.All 15Broader topic 5Related 7Compared with 3Graph coloringRelated: Its proof settled the planar case but not broader questions about chromatic number.CounterexampleRelated: Its long path from conjecture to proof illustrates how examples can suggest, but not establish, a universal claim.Recreational mathematicsRelated: Map-coloring puzzles helped motivate a theorem whose proof later relied on computation.Petersen graphRelated: The graph’s early history is tied to attempts to establish the theorem through edge-coloring methods.Chromatic polynomialRelated: It guarantees a positive chromatic-polynomial value at four for every planar graph.Wagner's theoremRelated: Wagner’s structural characterization concerns the same class of graphs studied by the coloring theorem.Grötzsch's theoremRelated: Grötzsch's result strengthens this bound when triangles are forbidden.