Combinatorica`
Combinatorica`

KnightsTourGraph

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

KnightsTourGraph[m,n]

returns a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight from one square to another.

Details

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

Text

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

BibTeX

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

BibLaTeX

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

CMS

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

APA

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