845 results on '"D. Seymour"'
Search Results
2. Erratum to: The LUX-ZEPLIN (LZ) radioactivity and cleanliness control programs
3. The LUX-ZEPLIN (LZ) radioactivity and cleanliness control programs
4. Induced subgraph density. II. Sparse and dense sets in cographs.
5. Effective Leadership in the Construction Industry
6. Pure Pairs. VIII. Excluding a Sparse Graph.
7. Bounded-Diameter Tree-Decompositions.
8. Graphs with all holes the same length.
9. On a problem of El-Zahar and Erdős.
10. Bipartite graphs with no K6 minor.
11. Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph.
12. Induced paths in graphs without anticomplete cycles.
13. Induced Subgraphs of Bounded Treewidth and the Container Method.
14. Pure Pairs. IX. Transversal Trees.
15. Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.
16. Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree.
17. Proof of a conjecture of Plummer and Zha.
18. Polynomial bounds for chromatic number VII. Disjoint holes.
19. Pure Pairs. V. Excluding Some Long Subdivision.
20. Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.
21. Pure pairs. IV. Trees in bipartite graphs.
22. Even-hole-free graphs still have bisimplicial vertices.
23. Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix.
24. Strengthening Rödl's theorem.
25. Clique covers of H-free graphs.
26. A Note on the Gyárfás-Sumner Conjecture.
27. Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.
28. Polynomial bounds for chromatic number II: Excluding a star-forest.
29. Polynomial bounds for chromatic number. III. Excluding a double star.
30. Pure Pairs VI: Excluding an Ordered Tree.
31. Cops and robbers on P5-free graphs.
32. Induced subgraphs of bounded treewidth and the container method.
33. Finding a Shortest Odd Hole.
34. Detecting a Long Odd Hole.
35. Pure Pairs. II. Excluding All Subdivisions of A Graph.
36. Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.
37. Erdős-Hajnal for cap-free graphs.
38. Concatenating Bipartite Graphs.
39. Polynomial bounds for chromatic number VI. Adding a four-vertex path.
40. A survey of χ-boundedness.
41. Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.
42. Short Directed Cycles in Bipartite Digraphs.
43. Induced subgraphs of graphs with large chromatic number. VI. Banana trees.
44. Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture.
45. Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.
46. Detecting an Odd Hole.
47. Induced subgraphs of graphs with large chromatic number. XII. Distant stars.
48. Bad news for chordal partitions.
49. H-colouring Pt-free graphs in subexponential time.
50. Clustered Colouring in Minor-Closed Classes.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.