The following pages link to The strong perfect graph theorem (Q855256):
Displaying 10 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- The Erdös-Hajnal Conjecture-A Survey (Q2874098) (← links)
- Odd Holes in Bull-Free Graphs (Q4638616) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
