Edge-choosability of planar graphs without adjacent triangles or without 7-cycles

Graph coloring problems

Choice Reviews Online · 1995 · 1.3K citations

Natural Sciences, Mathematics, Combinatorics +16

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

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 List Chromatic Index of a Bipartite Multigraph

Fred Galvin · Journal of Combinatorial Theory Series B · 1995 · 324 citations

Natural Sciences, Visualization, Combinatorics +7

List Edge and List Total Colourings of Multigraphs

O. V. Borodin, Alexandr Kostochka, Douglas R. Woodall · Journal of Combinatorial Theory Series B · 1997 · 248 citations

Natural Sciences, Visualization, Combinatorics +11