Perfect graph: Difference between revisions
(New page: <noinclude> </noinclude> '''Perfect graph''': A graph with the property that for every induced subgraph, the chromatic number eq...) |
(No difference)
|
Latest revision as of 14:34, 9 June 2008
Perfect graph: A graph with the property that for every induced subgraph, the chromatic number equals the clique number.
Term variations: Strongly perfect graph
No relevant subject wiki entry.
Also located at: Wikipedia:Perfect graph, Mathworld:PerfectGraph