cycle (713B)
1 # Cycle 2 3 A [simple_path] from one [vertex] to itself (= the path is simple except that the first vertex is equal to the last) 4 5 In [undirected_graphs], cycles are typically required to have length at least 3 ([triangle]). 6 7 In [directed_graphs], we have [directed_cycles] 8 9 Variants: 10 - [circuit_(graph)] if the same [vertices] (but not [edges]) can be visited multiple times 11 - like a [trail] compared to a [simple_path] 12 - [tour] if the same [vertices] and [edges] can be visited multiple times 13 - like a [walk] compared to a [simple_path] 14 15 - [cycle_induced] 16 17 Special cases: 18 19 - [hamiltonian_cycle] 20 - [eulerian_cycle] 21 - [odd_cycle] 22 - [even_cycle] 23 24 Up: [graph_basic_notions] 25 26 Aliases: cycles 27 28 See also: [2_regular]