Computer-assisted proofs Graph coloring Planar graphs
Conjectures that have been proved Graph coloring Topological graph theory
Heawood conjecture
Graph coloring
Graph coloring Theorems in graph theory
Five color theorem
Combinatorics Graph coloring Latin squares
Dinitz conjecture
Four color theorem
Four color theorem Example of a four-colored map A four-coloring of a…
Ver teorema Graph coloring Graph theory NP-complete problems
Graph coloring
Graph coloring (Redirected from Mycielski's theorem) Jump to navigation Jump to search…
Ver teoremaGrötzsch's theorem
Grötzsch's theorem A 3-coloring of a triangle-free planar graph In the mathematical…
Ver teorema Graph coloring Theorems in graph theory
Symmetric hypergraph theorem
Symmetric hypergraph theorem The Symmetric hypergraph theorem is a theorem in combinatorics…
Ver teorema Graph coloring Theorems in graph theory
Brooks' theorem
Brooks' theorem (Redirected from Brooks's theorem) Jump to navigation Jump to search…
Ver teorema Graph coloring Infinite graphs Theorems in graph theory
De Bruijn–Erdős theorem (graph theory)
De Bruijn–Erdős theorem (graph theory) This article is about coloring infinite graphs.…
Ver teorema Graph coloring
Equitable coloring
Equitable coloring (Redirected from Hajnal–Szemerédi theorem) Jump to navigation Jump to search…
Ver teorema