Concepedia
Journal of Combinatorial Theory Series B · 2008 · 58 citations · 46 references
Natural SciencesHigh-performance ComputingCombinatoricsGraph TheoryMatroid TheoryGraph Minors
46
Graph Minors .XIII. The Disjoint Paths Problem
Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1995 · 1.3K citations
Natural Sciences, Mathematics, Combinatorics +8
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
Graph Minors. XX. Wagner's conjecture
Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 2004 · 817 citations
Natural Sciences, Computer Science, Mathematics +4