Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs

Every planar map is four colorable

K. I. Appel, Wolfgang Haken · Bulletin of the American Mathematical Society · 1976 · 1.1K citations · Full text

Natural Sciences, Architectural Representation, Color Theory +5

The Four-Colour Theorem

Neil Robertson, Daniel P. Sanders, Paul Seymour et al. · Journal of Combinatorial Theory Series B · 1997 · 608 citations

An introduction to chromatic polynomials

Ronald C. Read · Journal of Combinatorial Theory · 1968 · 478 citations

Natural Sciences, Mathematics, Optics +4

Acyclic orientations of graphs

Richard P. Stanley · Discrete Mathematics · 1973 · 445 citations

Natural Sciences, Computer Science, Mathematics +6

A Determinant Formula for the Number of Ways of Coloring a Map

George D. Birkhoff · Annals of Mathematics · 1912 · 390 citations

Natural Sciences, Art History, Combinatorics +4