351 results on '"Maria Chudnovsky"'
Search Results
2. Sparse induced subgraphs in P6-free graphs.
Catalog
Books, media, physical & digital resources
3. List-k-Coloring H-Free Graphs for All k>4.
4. Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs.
5. Induced subgraphs and tree decompositions V. one neighbor in a hole.
6. Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.
7. Bipartite graphs with no K6 minor.
8. Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.
9. Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs.
10. Induced Subgraphs of Bounded Treewidth and the Container Method.
11. Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring.
12. Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring.
13. Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.
14. Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole.
15. Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets.
16. Tree Independence Number IV. Even-hole-free Graphs.
17. Unavoidable induced subgraphs in graphs with complete bipartite induced minors.
18. Proof of a conjecture of Plummer and Zha.
19. Polynomial bounds for chromatic number VII. Disjoint holes.
20. Even-hole-free graphs still have bisimplicial vertices.
21. Strengthening Rödl's theorem.
22. Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture.
23. Graphs with no even holes and no sector wheels are the union of two chordal graphs.
24. Characterizing and generalizing cycle completable graphs.
25. Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.
26. Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws.
27. Avoidable vertices and edges in graphs: Existence, characterization, and applications.
28. Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
29. Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree.
30. Graphs with polynomially many minimal separators.
31. Cops and robbers on P5-free graphs.
32. Reuniting χ-boundedness with polynomial χ-boundedness.
33. Sparse induced subgraphs in P_6-free graphs.
34. Max Weight Independent Set in sparse graphs with no long claws.
35. Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs.
36. Induced subgraphs of bounded treewidth and the container method.
37. Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.
38. Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.
39. Strongly perfect claw-free graphs - A short proof.
40. Finding a Shortest Odd Hole.
41. Detecting a Long Odd Hole.
42. Pure Pairs. II. Excluding All Subdivisions of A Graph.
43. List 3-Coloring Graphs with No Induced P6+rP3.
44. Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.
45. Erdős-Hajnal for cap-free graphs.
46. Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.
47. Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.
48. Complexity of Ck-Coloring in Hereditary Classes of Graphs.
49. Avoidable Vertices and Edges in Graphs.
50. Four-coloring P6-free graphs.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.