How to Use
Select graph:
- Test: P₄-free?
- Cotree: Decomposition
- Perfect: χ=ω
Cotree Decomposition
Every cograph has a cotree: binary tree with leaves = vertices. Internal nodes labeled 0 (disjoint union) or 1 (join/complement). Two vertices adjacent iff their LCA is labeled 1. Unique canonical cotree.
Properties
Cographs are perfect (χ=ω). Complement of cograph is cograph. Many NP-hard problems polynomial on cographs via cotree DP: clique, coloring, Hamiltonian path, domination. Widely studied graph class.
Step-by-Step Instructions
- 1Select graph.
- 2Check P₄-free.
- 3Build cotree.
- 4Find χ=ω.
- 5Solve problems.