Concepedia
Journal of Combinatorial Theory Series B · 1979 · 361 citations · 3 references
Natural SciencesMathematicsGeometryGraph DrawingGraph Layout AlgorithmsGraph TheoryPaper ThicknessThickness Distribution
3
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
Every planar map is four colorable. Part II: Reducibility
K. I. Appel, Wolfgang Haken, J. Koch · Illinois Journal of Mathematics · 1977 · 710 citations · Full text
Computing, Computer Systems, Computer Graphics +2
An inequality for the chromatic number of a graph
G Szekeres, Herbert S. Wilf · Journal of Combinatorial Theory · 1968 · 210 citations
Natural Sciences, Visualization, Combinatorics +3