Pages that link to "Paul Seymour (mathematician)"
Appearance
Showing 50 items.
- Four color theorem (links | edit)
- Graph theory (links | edit)
- Minimum spanning tree (links | edit)
- Complete graph (links | edit)
- Tree decomposition (links | edit)
- List of unsolved problems in mathematics (links | edit)
- Matroid (links | edit)
- Bipartite graph (links | edit)
- Cycle space (links | edit)
- École normale supérieure de Lyon (links | edit)
- Robertson–Seymour theorem (links | edit)
- Graph minor (links | edit)
- Knot (mathematics) (links | edit)
- Graph coloring (links | edit)
- Unimodular matrix (links | edit)
- List of conjectures (links | edit)
- Perfect graph (links | edit)
- Perfect graph theorem (links | edit)
- Line graph (links | edit)
- Edge coloring (links | edit)
- Erdős–Faber–Lovász conjecture (links | edit)
- Snark (graph theory) (links | edit)
- Chordal graph (links | edit)
- Strong perfect graph theorem (links | edit)
- Graphic matroid (links | edit)
- Linkless embedding (links | edit)
- Plymouth College (links | edit)
- Property B (links | edit)
- Complement graph (links | edit)
- Bridge (graph theory) (links | edit)
- Fulkerson Prize (links | edit)
- Neil Robertson (mathematician) (links | edit)
- Paul Seymour (mathematician) (transclusion) (links | edit)
- Induced subgraph (links | edit)
- Hadwiger conjecture (graph theory) (links | edit)
- Hadwiger number (links | edit)
- List of Princeton University people (links | edit)
- Five color theorem (links | edit)
- Colin de Verdière graph invariant (links | edit)
- Wagner's theorem (links | edit)
- Ostrowski Prize (links | edit)
- Pursuit–evasion (links | edit)
- Treewidth (links | edit)
- Seymour (surname) (links | edit)
- Pathwidth (links | edit)
- Haven (graph theory) (links | edit)
- Claude Berge (links | edit)
- George Pólya Prize (links | edit)
- Comparability graph (links | edit)
- Rook's graph (links | edit)