Sophie Theresa Spirkl

Author Info

Name	Affiliation	Papers
SOPHIE THERESA SPIRKL	Research Institute for Discrete Mathematics, Bonn, Germany	20
Collaborators	Citations	PageRank
21	8	7.36
Referers	Referees	References
15	154	77

Search Limit

100154

Publications (20 rows)

Collaborators (21 rows)

Referers (15 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
FINDING LARGE H-COLORABLE SUBGRAPHS IN HEREDITARY GRAPH CLASSES	0	0.34	2021
A Note On Simplicial Cliques	0	0.34	2021
List 3-Coloring Graphs With No Induced P-6 + Rp(3)	0	0.34	2021
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes	2	0.85	2020
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.	0	0.34	2020
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.	0	0.34	2020
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s	0	0.34	2020
Complexity of Ck-Coloring in Hereditary Classes of Graphs.	0	0.34	2019
Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorable	0	0.34	2019
H-colouring Pt-free graphs in subexponential time	1	0.35	2019
Triangle-free graphs with no six-vertex induced path.	0	0.34	2018
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39].	0	0.34	2018
The Sandwich Problem for Decompositions and Almost Monotone Properties.	0	0.34	2018
Even pairs and prism corners in square-free Berge graphs.	0	0.34	2018
Sandwich and probe problems for excluding paths.	0	0.34	2018
Colouring perfect graphs with bounded clique number.	0	0.34	2017
Approximately coloring graphs without long induced paths.	0	0.34	2017
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles	1	0.36	2014
Fast Prefix Adders for Non-Uniform Input Arrival Times.	2	0.38	2014
The guillotine approach for TSP with neighborhoods revisited.	2	0.36	2013