A longest cycle of a graph is a graph cycle having maximum length. The length of a longest cycle is the graph circumference.
A longest cycle that contains every graph vertex is a Hamiltonian cycle.
Longest Cycle
See also
Graph Circumference, Graph Cycle, Hamiltonian Cycle, Longest PathExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Longest Cycle." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/LongestCycle.html