Shortest coverings of graphs with cycles

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 1.7K citations · Full text

Natural Sciences, Computer Science, Mathematics +8

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

Matching, Euler tours and the Chinese postman

Jack Edmonds, Ellis L. Johnson · Mathematical Programming · 1973 · 987 citations

Natural Sciences, History, Combinatorics +1

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

Flows and generalized coloring theorems in graphs

F. M. Jaeger · Journal of Combinatorial Theory Series B · 1979 · 247 citations

Natural Sciences, Mathematics, Color Theory +10