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 3Mathematical proofBroader topic: Its computer-assisted proof prompted debate about how much computation a proof may require.Graph 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.TheoremBroader topic: Its proof, which relies on computer-assisted checking, broadened discussion of what counts as proof.Computer-assisted proofBroader topic: Its first proof relied on computer-checked configurations and reducibility.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.Mathematical conjectureBroader topic: Its proof, which uses extensive computation, illustrates debate over acceptable proof methods.Wagner's theoremRelated: Wagner’s structural characterization concerns the same class of graphs studied by the coloring theorem.Mathematical problemBroader topic: Its proof illustrates how a finite coloring question can require extensive computation.Five color theoremCompared with: It sharpens the five-color upper bound by one color.Heawood conjectureCompared with: For genus zero, the conjectured expression overshoots the true planar maximum.De Bruijn–Erdős theorem (graph theory)Compared with: It proves a finite-color bound for planar graphs, while De Bruijn–Erdős transfers finite checks to infinite graphs.Grötzsch's theoremRelated: Grötzsch's result strengthens this bound when triangles are forbidden.