MeredithGraph
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.
Details and Options
- 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 Language function, https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html.
Text
Wolfram Research (2012), MeredithGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html.
CMS
Wolfram Language. 2012. "MeredithGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html.
APA
Wolfram Language. (2012). MeredithGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/MeredithGraph.html