Perfect graph

From Ref
Revision as of 14:34, 9 June 2008 by Vipul (talk | contribs) (New page: <noinclude> </noinclude> '''Perfect graph''': A graph with the property that for every induced subgraph, the chromatic number eq...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


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

Retrieved from "https://subwiki.org/w/index.php?title=Perfect_graph&oldid=106"