The following pages link to Neil Robertson (mathematician)
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Four color theorem (links | edit)
- Graph theory (links | edit)
- W. T. Tutte (links | edit)
- Complete graph (links | edit)
- Tree decomposition (links | edit)
- List of unsolved problems in mathematics (links | edit)
- Bipartite graph (links | edit)
- Robertson–Seymour theorem (links | edit)
- Graph minor (links | edit)
- Knot (mathematics) (links | edit)
- Graph coloring (links | edit)
- List of conjectures (links | edit)
- Perfect graph (links | edit)
- Perfect graph theorem (links | edit)
- Line graph (links | edit)
- Snark (graph theory) (links | edit)
- Strong perfect graph theorem (links | edit)
- Linkless embedding (links | edit)
- Brandon University (links | edit)
- Fulkerson Prize (links | edit)
- Paul Seymour (mathematician) (links | edit)
- Induced subgraph (links | edit)
- Hadwiger conjecture (graph theory) (links | edit)
- Hadwiger number (links | edit)
- Five color theorem (links | edit)
- Neil Robertson (links | edit)
- Automated reasoning (links | edit)
- Colin de Verdière graph invariant (links | edit)
- Treewidth (links | edit)
- List of University of Waterloo people (links | edit)
- Pathwidth (links | edit)
- Haven (graph theory) (links | edit)
- Claude Berge (links | edit)
- George Pólya Prize (links | edit)
- Rook's graph (links | edit)
- Discharging method (discrete mathematics) (links | edit)
- Split graph (links | edit)
- Claw-free graph (links | edit)
- Forbidden graph characterization (links | edit)
- List of people by Erdős number (links | edit)
- Journal of Combinatorial Theory (links | edit)
- Branch-decomposition (links | edit)
- Klaus Wagner (links | edit)
- Institute of Combinatorics and its Applications (links | edit)
- Clique-sum (links | edit)
- Star (graph theory) (links | edit)
- Maria Chudnovsky (links | edit)
- Graph structure theorem (links | edit)
- Erdős–Pósa theorem (links | edit)
- Combinatorica (links | edit)