Exercise 471Combinatorics › Graph theoryHigh schoolAdded 3 Nov 2026
Paths and cycles
#path#cycle#walk
Statement
Define walk, path, and cycle in a graph. Give an example where a walk is not a path.
Hint
A path has no repeated vertex; a walk may.
Show solutionHide solution
Solution
Definitions.
- *Walk*: sequence of vertices with .
- *Path*: walk with all vertices distinct.
- *Cycle*: closed walk with distinct.
Example. In a triangle ---, the sequence ---- is a walk but not a path (vertex repeats).
Conclusion. Every path is a walk; the converse fails when vertices repeat.