Combinatorica`
Combinatorica`

HamiltonianCycle

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

HamiltonianCycle[g]

finds a Hamiltonian cycle in graph g if one exists.

HamiltonianCycle[g,All]

gives all Hamiltonian cycles of graph g.

Details

Examples

Basic Examples  (2)

HamiltonianCycle has been superseded by FindHamiltonianCycle:

Wolfram Research (2012), HamiltonianCycle, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.

Text

Wolfram Research (2012), HamiltonianCycle, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.

BibTeX

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

BibLaTeX

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

CMS

Wolfram Language. 2012. "HamiltonianCycle." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.

APA

Wolfram Language. (2012). HamiltonianCycle. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html