Combinatorica`
Combinatorica`
HamiltonianQ
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
HamiltonianQ[g]
yields True if there exists a Hamiltonian cycle in graph 
, or in other words, if there exists a cycle that visits each vertex exactly once.
Details and Options
- HamiltonianQ functionality is now available in the built-in Wolfram Language function HamiltonianGraphQ.
- To use HamiltonianQ, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
HamiltonianQ has been superseded by HamiltonianGraphQ:
Wolfram Research (2012), HamiltonianQ, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html.
Text
Wolfram Research (2012), HamiltonianQ, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html.
CMS
Wolfram Language. 2012. "HamiltonianQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html.
APA
Wolfram Language. (2012). HamiltonianQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html