eulerian_path (380B)
1 # Eulerian path 2 3 A [trail] that visits every [edge] of a [graph] exactly once 4 5 Can be defined for [graph_directed] or [graph_undirected] 6 7 [Decision_problem]: [Eulerian_path_decision] 8 9 Also: 10 11 - [Eulerian_trail_counting] 12 - [Eulerian_trail_enumeration] 13 14 Variants: 15 - [eulerian_cycle] 16 - [chinese_postman_problem] 17 18 Up: [path] 19 20 See also: [Eulerian_partitioning] 21 22 Aliases: Eulerian trail