PerfectQ
PerfectQ[g]
yields True if 
is a perfect graph, meaning that for every induced subgraph of 
, the size of a largest clique equals the chromatic number.
Combinatorica`
Combinatorica`
PerfectQ
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
PerfectQ[g]
yields True if 
is a perfect graph, meaning that for every induced subgraph of 
, the size of a largest clique equals the chromatic number.
更多信息和选项
- To use PerfectQ, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，PerfectQ，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/PerfectQ.html.
文本
Wolfram Research (2012)，PerfectQ，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/PerfectQ.html.
CMS
Wolfram 语言. 2012. "PerfectQ." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/PerfectQ.html.
APA
Wolfram 语言. (2012). PerfectQ. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/PerfectQ.html 年