74 results on '"Spirkl, Sophie"'
Search Results
2. List-k-Coloring H-Free Graphs for All $$k>4$$
3. Tree independence number I. (Even hole, diamond, pyramid)‐free graphs
4. List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraphs
5. Hitting all maximum stable sets in P5-free graphs
6. Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring
7. Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring
8. Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
9. Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
10. Bipartite graphs with no K6 minor
11. Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree
12. Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs
13. Induced subgraphs and tree decompositions V. one neighbor in a hole
14. Strengthening Rödl's theorem
15. Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path
16. Pure pairs. IV. Trees in bipartite graphs
17. Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
18. Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs
19. Pure Pairs. V. Excluding Some Long Subdivision
20. Complexity of C-coloring in hereditary classes of graphs
21. Four-coloring P6-free graphs
22. Polynomial bounds for chromatic number VII. Disjoint holes
23. Polynomial bounds for chromatic number VI. Adding a four-vertex path
24. The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
25. Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
26. Erdős–Hajnal for graphs with no 5‐hole
27. A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
28. Digraphs with All Induced Directed Cycles of the Same Length are not $\vec{\chi}$-Bounded
29. Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
30. Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth
31. Approximately Coloring Graphs Without Long Induced Paths
32. Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph
33. Plethysms of Chromatic and Tutte Symmetric Functions
34. Polynomial bounds for chromatic number. III. Excluding a double star
35. Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
36. Concatenating Bipartite Graphs
37. Polynomial bounds for chromatic number II: Excluding a star‐forest
38. Modular relations of the Tutte symmetric function
39. Further Approximations for Aharoni's Rainbow Generalization of the Caccetta-Häggkvist Conjecture
40. Pure Pairs VI: Excluding an Ordered Tree
41. A note on simplicial cliques
42. Finding an induced path that is not a shortest path
43. Pure Pairs. II. Excluding All Subdivisions of A Graph
44. On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture
45. A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function
46. On symmetric intersecting families of vectors
47. Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
48. A Complete Multipartite Basis for the Chromatic Symmetric Function
49. Pure pairs. I. Trees and linear anticomplete pairs
50. List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.