Browsing by Academic Advisor Seymour, Paul
Showing results 1 to 17 of 17
| Class Year | Author(s) | Title | Advisor |
| 2020 | Lovelace, Seth | A Structural Survey of Forest and Antiforest Free Graphs | Seymour, Paul |
| - | Spirkl, Sophie Theresa | Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs | Chudnovsky, Maria; Seymour, Paul |
| 2013 | Lo, Irene Yuan | Excluding a near-clique and a near-anticlique with specified numbers of neighbors or non-neighbors | Seymour, Paul |
| 1997 | Williams, Karla S.; Wiilliams, Karla S. | Families of Subtrees and the Optical Network Unit Placement Problem | Seymour, Paul |
| 2012 | Sengupta, Rik | Hedgewidth in Series-Parallel Graphs | Seymour, Paul |
| 2012 | Leaf, Alexander | Improved Bounds for the Excluded Grid Theorem | Seymour, Paul |
| 2003 | Mihaescu, Radu | The Max Flow Min Cut Property in T-join Hypergraphs of Planar Graphs | Seymour, Paul |
| - | Cook, Linda | On recognition algorithms and structure of graphs with restricted induced cycles | Seymour, Paul |
| 2022 | Pagano, Vincent | On the Existence of Polynomially Large Cliques or Stable Sets in H-free Graphs | Seymour, Paul |
| 2003 | Slep, Mitchell | On the Structure of Choice-Perfect Graphs | Seymour, Paul |
| - | Kim, Ringi | On unavoidable graphs and tournaments | Seymour, Paul |
| 1997 | Scott, Katherine W. | Outermobius and Cylindrical Graphs | Seymour, Paul |
| 2007 | Werness, Brent M. | Structural Theorems on Tournaments | Seymour, Paul |
| 2001 | Smadbeck, Louis | A Structure Theorem for Excluding a General Unicyclic Minor | Seymour, Paul |
| 2016 | Meng, Henry | Sums of Directed Cycles and Directed Paths | Seymour, Paul |
| 2014 | Pohoata, Andrei Cosmin | Unavoidable Induced Subgraphs of Large Graphs | Seymour, Paul |
| 2012 | Liu, Xue | Various Theorems on Tournaments | Seymour, Paul |