Heawood conjecture

# Graph coloring

Five color theorem

Dinitz conjecture

Four color theorem

Four color theorem Example of a four-colored map A four-coloring of a…

Ver teoremaGraph 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 teoremaSymmetric hypergraph theorem

Symmetric hypergraph theorem The Symmetric hypergraph theorem is a theorem in combinatorics…

Ver teoremaBrooks' theorem

Brooks' theorem (Redirected from Brooks's theorem) Jump to navigation Jump to search…

Ver teoremaDe Bruijn–Erdős theorem (graph theory)

De Bruijn–Erdős theorem (graph theory) This article is about coloring infinite graphs.…

Ver teoremaEquitable coloring

Equitable coloring (Redirected from Hajnal–Szemerédi theorem) Jump to navigation Jump to search…

Ver teorema