From: ariskin@mps.org
Newsgroups: sci.math
Subject: Re: perfect graphs
Date: Mon, 26 Jan 1998 16:26:22 -0600

In article <885764201.567148545@dejanews.com>,
  sjmunn@stthomas.edu wrote:
>
> I need a definition of a perfect graph.  Replies can be sent to my email
> address or posted to this group.  Any information would be appreciated.
> Thank you.
>


The __clique number__ of a graph G, denoted omega(G), is the maximum order
among the complete subgraphs of G.

The __chromatic number__ of g, denoted chi(G), is the minimum number of colors
to properly color G.

A graph G is __perfect__ provided that omega(H)=chi(H) for each induced
subgraph H of G.

From  Chartrand and Lesniak.

HTH

Adrian