Excluding paths and antipaths
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 970798 (Why is no real title available?)
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
- Normal hypergraphs and the perfect graph conjecture
- Ramsey-type theorems
- Ramsey-type theorems with forbidden subgraphs
- Some remarks on the theory of graphs
- The Erdős-Hajnal conjecture for bull-free graphs
- The Erdős-Hajnal conjecture for paths and antipaths
- The strong perfect graph theorem
Cited in
(10)- Excluding hooks and their complements
- Erdős-Hajnal for cap-free graphs
- Pure pairs. II: Excluding all subdivisions of a graph
- Towards Erdős-Hajnal for graphs with no 5-hole
- The Erdős-Hajnal conjecture for paths and antipaths
- The Erdős-Hajnal conjecture for long holes and antiholes
- The Erdős-Hajnal conjecture. A survey
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
- Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the \(H_{6}\)-conjecture
- Towards the Erdős-Hajnal conjecture for P₅-free graphs
This page was built for publication: Excluding paths and antipaths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520043)