Combinatorica`
Combinatorica`
MeredithGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
MeredithGraph
returns a 4-regular, 4-connected graph that is not Hamiltonian, providing a counterexample to a conjecture by C. St. J. A. Nash-Williams.
更多信息和选项
- MeredithGraph functionality is now available in the built-in Wolfram Language function GraphData.
- To use MeredithGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，MeredithGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html.
文本
Wolfram Research (2012)，MeredithGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html.
CMS
Wolfram 语言. 2012. "MeredithGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html.
APA
Wolfram 语言. (2012). MeredithGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html 年