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 ...

mathworld.wolfram.com/HamiltonianPath.html

**Hamiltonian Path**. A **Hamiltonian path**, also called a **Hamilton path**, is a graph
path between two vertices of a graph that visits each vertex exactly once.

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 ...

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

When we looked at Euler Paths (trails) and Euler **circuits**, we were focused on
using each of the edges just once. Another way to look at networks is to consider
...

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.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 ...

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

We can also make a **Hamilton circuit** into its “mirror image” by reversing direction.
The mirror image uses the same edges, but backwards, so it is not considered ...