The Strong Perfect Graph Theorem

reportActive / Technical Report | Accession Number: AD1021246 | Open PDF

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.

Author(s):
Cornuejols, Gerard
Author Organization(s):
Carnegie Mellon Universtiy Pittsburgh United States
Descriptive Note:
Journal Article - Open Access
Supplementary Note:
Optima , 70, 01 Jan 0001, 01 Jan 0001,
Pagination:
0008

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release;

RECORD

Collection: TR
Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
Graphs, Theorem
Field(s)/Group(s):
Numerical Mathematics
Report Date:
2003 Mar 08
Creation Date:
2003 Mar 08