A New Bound on the Cyclic Chromatic Number

Graph coloring problems

Choice Reviews Online · 1995 · 1.3K citations

Natural Sciences, Mathematics, Combinatorics +16

Every planar map is four colorable. Part I: Discharging

K. I. Appel, Wolfgang Haken · Illinois Journal of Mathematics · 1977 · 879 citations

Architecture, Architectural Representation, Descriptive Geometry +2

The Four-Colour Theorem

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

On cyclic colorings and their generalizations

O. V. Borodin, Daniel P. Sanders, Yue Zhao · Discrete Mathematics · 1999 · 34 citations

Natural Sciences, Computer Science, Mathematics +6