Combinatorica`
Combinatorica`
FranklinGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
FranklinGraph
returns a 12-vertex graph that represents a 6-chromatic map on the Klein bottle. It is the sole counterexample to Heawood's map-coloring conjecture.
更多信息和选项
- FranklinGraph functionality is now available in the built-in Wolfram Language function GraphData.
- To use FranklinGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，FranklinGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/FranklinGraph.html.
文本
Wolfram Research (2012)，FranklinGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/FranklinGraph.html.
CMS
Wolfram 语言. 2012. "FranklinGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/FranklinGraph.html.
APA
Wolfram 语言. (2012). FranklinGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/FranklinGraph.html 年