Definition:Path (Graph Theory)/Also known as

Definition

Some sources refer to what $\mathsf{Pr} \infty \mathsf{fWiki}$ calls a path as a simple path, and use the term path to define what $\mathsf{Pr} \infty \mathsf{fWiki}$ defines as a walk.

A path in a graph $G$ can be referred to as a $G$-path.

Some sources use the word chain.

Some sources refer to this as a Hamiltonian walk for William Rowan Hamilton.

Some sources are not careful to distinguish between a walk and a path, glossing over the possibility of repetition of vertices.

Sources

• 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.2$ Graphs and Trees
• 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): chain: 4.
• 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): path: 1.