The following pages link to P. D. Seymour (Q705887):
Displaying 16 items.
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes (Q723885) (← links)
- Graph minors. III. Planar tree-width (Q799684) (← links)
- Bipartite minors (Q896000) (← links)
- Graph minors. I. Excluding a forest (Q1055450) (← links)
- Decomposition of regular matroids (Q1144028) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
- The four-colour theorem (Q1369648) (← links)
- Progress on perfect graphs (Q1403295) (← links)
- Graph minors. XIII: The disjoint paths problem (Q1892832) (← links)
- Large rainbow matchings in general graphs (Q2422240) (← links)
- Perfect matchings in planar cubic graphs (Q2454587) (← links)
- Recognizing Berge graphs (Q2494439) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- A generalization of chordal graphs (Q3328563) (← links)
