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

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

xlinux.nist.gov/dads/HTML/hamiltonianCycle.html

Definition of **Hamiltonian cycle**, possibly with links to more information and
implementations.

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

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

www.hackerearth.com/practice/algorithms/graphs/hamiltonian-path/tutorial

Detailed tutorial on **Hamiltonian Path** to improve your understanding of
Algorithms. Also try practice problems to test & improve your skill level.