Follow
Sophie Spirkl
Sophie Spirkl
Verified email at uwaterloo.ca - Homepage
Title
Cited by
Cited by
Year
Four-coloring P 6-free graphs
M Chudnovsky, S Spirkl, M Zhong
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
552019
A deletion–contraction relation for the chromatic symmetric function
L Crew, S Spirkl
European Journal of Combinatorics 89, 103143, 2020
402020
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
40*2020
Pure pairs. I. Trees and linear anticomplete pairs
M Chudnovsky, A Scott, P Seymour, S Spirkl
Advances in Mathematics, 107396, 2020
392020
Detecting an odd hole
M Chudnovsky, A Scott, P Seymour, S Spirkl
Journal of the ACM (JACM) 67 (1), 1-12, 2020
382020
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
312024
Erdős–Hajnal for graphs with no 5‐hole
M Chudnovsky, A Scott, P Seymour, S Spirkl
Proceedings of the London Mathematical Society, 2023
30*2023
Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path
A Scott, P Seymour, S Spirkl
302021
Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth
M Chudnovsky, T Abrishami, S Hajebi, S Spirkl
Advances in Combinatorics, 2022
28*2022
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
272019
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
262023
List 3-Coloring Graphs with No Induced P 6 + r P 3
M Chudnovsky, S Huang, S Spirkl, M Zhong
Algorithmica, 1-36, 2020
26*2020
Pure pairs. II. Excluding all subdivisions of a graph
M Chudnovsky, A Scott, P Seymour, S Spirkl
Combinatorica, 2021
24*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
242020
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
222024
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
212023
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
192022
Caterpillars in Erdős–Hajnal
A Liebenau, M Pilipczuk, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 136, 33-43, 2019
172019
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
172014
Induced subgraphs and tree decompositions V. One neighbor in a hole
T Abrishami, B Alecu, M Chudnovsky, S Hajebi, S Spirkl, K Vušković
Journal of Graph Theory 105 (4), 542-561, 2024
16*2024
The system can't perform the operation now. Try again later.
Articles 1–20