perfect graph theorem
E1900763
UNEXPLORED
The perfect graph theorem is a fundamental result in graph theory that characterizes perfect graphs by proving that a graph is perfect if and only if its complement is also perfect.
All labels observed (1)
| Label | Occurrences |
|---|---|
| perfect graph theorem canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.