Uniquely3ColorableGraph
Combinatorica`
Combinatorica`
Uniquely3ColorableGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
Uniquely3ColorableGraph
returns a 12-vertex, triangle-free graph with chromatic number 3 that is uniquely 3-colorable.
更多信息和选项
- Uniquely3ColorableGraph functionality is now available in the built-in Wolfram Language function GraphData.
- To use Uniquely3ColorableGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，Uniquely3ColorableGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/Uniquely3ColorableGraph.html.
文本
Wolfram Research (2012)，Uniquely3ColorableGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/Uniquely3ColorableGraph.html.
CMS
Wolfram 语言. 2012. "Uniquely3ColorableGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/Uniquely3ColorableGraph.html.
APA
Wolfram 语言. (2012). Uniquely3ColorableGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/Uniquely3ColorableGraph.html 年