The following pages link to Maria Chudnovsky (Q256974):
Displaying 50 items.
- Unavoidable induced subgraphs in large graphs with no homogeneous sets (Q256979) (← links)
- Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures (Q256991) (← links)
- Disjoint dijoins (Q290802) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Rao's degree sequence conjecture (Q401494) (← links)
- Excluding pairs of graphs (Q402589) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs (Q411837) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures (Q411838) (← links)
- Three-colourable perfect graphs without even pairs (Q412165) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Detecting an induced net subdivision (Q461729) (← links)
- Tournaments with near-linear transitive subsets (Q462934) (← links)
- Disjoint paths in tournaments (Q481696) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Edge-colouring seven-regular planar graphs (Q491000) (← links)
- Edge-colouring eight-regular planar graphs (Q491001) (← links)
- Excluding paths and antipaths (Q520043) (← links)
- Claw-free graphs. VI: Colouring (Q602712) (← links)
- The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
- A well-quasi-order for tournaments (Q618033) (← links)
- The three-in-a-tree problem (Q653792) (← links)
- Induced subgraphs of graphs with large chromatic number. III: Long holes (Q722311) (← links)
- Tournament immersion and cutwidth (Q765193) (← links)
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters (Q765202) (← links)
- The structure of bull-free graphs II and III -- a summary (Q765203) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- The strong perfect graph theorem (Q855256) (← links)
- The roots of the independence polynomial of a clawfree graph (Q875937) (← links)
- Packing non-zero \(A\)-paths in group-labelled graphs (Q879161) (← links)
- Immersion in four-edge-connected graphs (Q895999) (← links)
- Bipartite minors (Q896000) (← links)
- Claw-free graphs. III: Circular interval graphs (Q933683) (← links)
- Claw-free graphs. IV: Decomposition theorem (Q947722) (← links)
- Cycles in dense digraphs (Q949775) (← links)
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs (Q949790) (← links)
- Bisimplicial vertices in even-hole-free graphs (Q958679) (← links)
- The Erdős-Hajnal conjecture for bull-free graphs (Q958690) (← links)
- Claw-free graphs. V. Global structure (Q958695) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- Even pairs in Berge graphs (Q1003839) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Progress on perfect graphs (Q1403295) (← links)
- On the Erdős-Hajnal conjecture for six-vertex tournaments (Q1621068) (← links)
- Induced subgraphs of graphs with large chromatic number. XI. Orientations (Q1633601) (← links)
- Triangle-free graphs with no six-vertex induced path (Q1637133) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Disjoint paths in unions of tournaments (Q1719586) (← links)
- Domination in tournaments (Q1745734) (← links)
- Even pairs and prism corners in square-free Berge graphs (Q1748264) (← links)
