Four-coloring P 6-free graphs M Chudnovsky, S Spirkl, M Zhong Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 53 | 2019 |
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes M Chudnovsky, A Scott, P Seymour, S Spirkl Journal of Combinatorial Theory, Series B 140, 84-97, 2020 | 38* | 2020 |
A deletion–contraction relation for the chromatic symmetric function L Crew, S Spirkl European Journal of Combinatorics 89, 103143, 2020 | 37 | 2020 |
Pure pairs. I. Trees and linear anticomplete pairs M Chudnovsky, A Scott, P Seymour, S Spirkl Advances in Mathematics, 107396, 2020 | 37 | 2020 |
Detecting an odd hole M Chudnovsky, A Scott, P Seymour, S Spirkl Journal of the ACM (JACM) 67 (1), 1-12, 2020 | 37 | 2020 |
Erdős–Hajnal for graphs with no 5‐hole M Chudnovsky, A Scott, P Seymour, S Spirkl Proceedings of the London Mathematical Society, 2023 | 28* | 2023 |
H-colouring Pt-free graphs in subexponential time C Groenland, K Okrasa, P Rzążewski, A Scott, P Seymour, S Spirkl Discrete Applied Mathematics 267, 184-189, 2019 | 27 | 2019 |
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree T Abrishami, M Chudnovsky, C Dibek, S Hajebi, P Rzążewski, S Spirkl, ... Journal of Combinatorial Theory, Series B 164, 371-403, 2024 | 25 | 2024 |
Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path A Scott, P Seymour, S Spirkl | 24 | 2021 |
Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth M Chudnovsky, T Abrishami, S Hajebi, S Spirkl Advances in Combinatorics, 2022 | 23* | 2022 |
Pure pairs. II. Excluding all subdivisions of a graph M Chudnovsky, A Scott, P Seymour, S Spirkl Combinatorica, 2021 | 23* | 2021 |
A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function J Aliste-Prieto, L Crew, S Spirkl, J Zamora arXiv preprint arXiv:2007.11042, 2020 | 22 | 2020 |
List 3-Coloring Graphs with No Induced P 6 + r P 3 M Chudnovsky, S Huang, S Spirkl, M Zhong Algorithmica, 1-36, 2020 | 21* | 2020 |
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree A Scott, P Seymour, S Spirkl Journal of Graph Theory 102 (3), 458-471, 2023 | 20 | 2023 |
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number A Carbonero, P Hompe, B Moore, S Spirkl Journal of Combinatorial Theory, Series B 158, 63-69, 2023 | 20 | 2023 |
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs T Abrishami, B Alecu, M Chudnovsky, S Hajebi, S Spirkl Journal of Combinatorial Theory, Series B 164, 443-472, 2024 | 17* | 2024 |
Caterpillars in Erdős–Hajnal A Liebenau, M Pilipczuk, P Seymour, S Spirkl Journal of Combinatorial Theory, Series B 136, 33-43, 2019 | 17 | 2019 |
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles S Held, ST Spirkl Proceedings of the 2014 on International symposium on physical design, 37-44, 2014 | 17 | 2014 |
Polynomial bounds for chromatic number. III. Excluding a double star A Scott, P Seymour, S Spirkl Journal of Graph Theory 101 (2), 323-340, 2022 | 16 | 2022 |
Induced subgraphs and tree decompositions IV.(Even hole, diamond, pyramid)-free graphs T Abrishami, M Chudnovsky, S Hajebi, S Spirkl arXiv preprint arXiv:2203.06775, 2022 | 15 | 2022 |