Combinatorica`
Combinatorica`

ThomassenGraph

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

ThomassenGraph

returns a hypotraceable graph, a graph that has no Hamiltonian path but whose subgraph for every vertex has a Hamiltonian path.

Details

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

Text

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

BibTeX

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

BibLaTeX

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

CMS

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

APA

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