How to Use
Select graph:
- Test: Perfect?
- Holes: Odd hole check
- Antiholes: Odd antihole
Strong Perfect Graph Theorem
Conjectured by Berge (1961). Proved by Chudnovsky et al. (2006): 179-page proof! G is perfect iff G has no induced C_{2k+1} (k≥2) and no induced complement of C_{2k+1} (k≥2). Monumental result.
Perfect Graph Classes
Bipartite ⊂ comparability ⊂ perfect. Chordal ⊂ perfect. Interval ⊂ chordal ⊂ perfect. Split ⊂ chordal ⊂ perfect. Cographs ⊂ perfect. Each class has specialized algorithms.
Step-by-Step Instructions
- 1Select graph.
- 2Check perfect.
- 3Find odd holes.
- 4Check complement.
- 5Apply SPGT.