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 g, or in other words, if there exists a cycle that visits each vertex exactly once.

Details

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.

BibTeX

@misc{reference.wolfram_2021_hamiltonianq, author="Wolfram Research", title="{HamiltonianQ}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html}", note=[Accessed: 27-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_hamiltonianq, organization={Wolfram Research}, title={HamiltonianQ}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html}, note=[Accessed: 27-September-2021 ]}

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