Accession Number:

AD1021246

Title:

The Strong Perfect Graph Theorem

Descriptive Note:

Journal Article - Open Access

Corporate Author:

Carnegie Mellon Universtiy Pittsburgh United States

Personal Author(s):

Report Date:

2003-03-08

Pagination or Media Count:

8.0

Abstract:

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.

Descriptors:

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE