eulerian_circuit (309B)
1 # Eulerian circuit 2 3 A [Eulerian_trail] which is a [cycle_circuit], i.e., starts and ends at the same [vertex] 4 5 The number of Eulerian circuits in [directed_graphs] can be computed in [PTIME] by the [BEST_theorem] 6 7 - [Eulerian_circuit_counting] 8 9 Up: [eulerian_path] 10 11 Aliases: Eulerian cycle, Eulerian circuits