en.wikipedia.org/wiki/Hamiltonian_path

In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once.

mathworld.wolfram.com/HamiltonianCycle.html

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

mathspace.co/learn/world-of-maths/networks/hamiltonian-paths-and-circuits-18715/hamiltonian-paths-and-circuits-1280

A Hamiltonian circuit, is a circuit (cycle) that visits each of the vertices once and only once and ends on the same vertex as it began. For example, in this network ...

www.geeksforgeeks.org/backtracking-set-7-hamiltonian-cycle

Hamiltonian Path in an undirected graph is a path that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian Path such ...

www.math.wisc.edu/~meyer/math141/graphs2.html

A Hamiltonian Circuit is a circuit that visits every vertex exactly once. Do these graphs have a Hamiltonian circuit? Example 1: Example 2: Real life applications:

www.ctl.ua.edu/math103/hamilton/analyzin.htm

Unfortunately, there are no counterparts to Euler's theorems that tell us, in general, whether or not a graph has a Hamilton Circuit. Example 1: Find both an Euler ...

www.math.ku.edu/~jmartin/courses/math105-F11/Lectures/chapter6-part1.pdf

Hamilton Paths and Hamilton Circuits. A Hamilton path is a path that uses every vertex of a graph exactly once. A Hamilton circuit is a circuit that uses every ...

www.cs.sfu.ca/~ggbaker/zju/math/euler-ham.html

Euler Paths and Circuits. An Euler circuit (or Eulerian circuit ) in a graph G is a simple circuit that contains every edge of G. Reminder: a simple circuit doesn't use ...