The Strong Perfect Graph Theorem
Journal Article - Open Access
Carnegie Mellon Universtiy Pittsburgh United States
Pagination or Media Count:
In this note, all graphs are simple no loops or multiple edges and finite. The vertex set of graph G is denoted by VG and its edge set by EG. A stable set is a set of vertices no two of which are adjacent. A clique is a set of vertices every pair of which are adjacent. The cardinality of a largest clique in graph G is denoted by omegaG.
- Numerical Mathematics