DOCUMENTATION CENTER SEARCH

New to Mathematica? Find your learning path »

Combinatorica Package >

COMBINATORICA PACKAGE SYMBOL

Tutorials »|See Also »|More About »

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.

MORE INFORMATION

To use , you first need to load the Combinatorica Package using .

FiniteGraphs HamiltonianCycle

Combinatorica

Built-in Graphs

Ask a question about this page | Suggest an improvement | Leave a message for the team

Format: HTML | CDF